Descriptional Complexity of Pushdown Store Languages. - Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2012)

Nondeterministic state complexity of star-free languages. - Markus Holzer 001; Martin Kutrib; Katja Meckel (Theor. Comput. Sci., 2012)

A Direct Construction of Finite State Automata for Pushdown Store Languages. - Viliam Geffert; Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (DCFS, 2013)

Queue Automata of Constant Length. - Sebastian Jakobi; Katja Meckel; Carlo Mereghetti; Beatrice Palano (DCFS, 2013)

Parameterized Prefix Distance between Regular Languages. - Martin Kutrib; Katja Meckel; Matthias Wendlandt (SOFSEM, 2014)

Measuring defects in finite automata. - Katja Meckel (2016)

The descriptional power of queue automata of constant length. - Sebastian Jakobi; Katja Meckel; Carlo Mereghetti; Beatrice Palano (Acta Informatica, 2021)