Chop Operations and Expressions: Descriptional Complexity Considerations. - Markus Holzer 001; Sebastian Jakobi (Developments in Language Theory, 2011)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Giovanni Pighizzini (DCFS, 2012)

State Complexity of Chop Operations on Unary and Finite Languages. - Markus Holzer 001; Sebastian Jakobi (DCFS, 2012)

From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract). - Markus Holzer 001; Sebastian Jakobi (Developments in Language Theory, 2012)

Generalized Derivations with Synchronized Context-Free Grammars. - Markus Holzer 001; Sebastian Jakobi; Ian McQuillan (Developments in Language Theory, 2012)

On the Complexity of Rolling Block and Alice Mazes. - Markus Holzer 001; Sebastian Jakobi (FUN, 2012)

Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. - Markus Holzer 001; Sebastian Jakobi (FUN, 2012)

The Magic Number Problem for Subregular Language Families. - Markus Holzer 001; Sebastian Jakobi; Martin Kutrib (Int. J. Found. Comput. Sci., 2012)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (J. Autom. Lang. Comb., 2012)

Descriptional Complexity of Chop Operations on Unary and Finite Languages. - Markus Holzer 001; Sebastian Jakobi (J. Autom. Lang. Comb., 2012)

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

Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). - Markus Holzer 001; Sebastian Jakobi (CIAA, 2013)

From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors. - Markus Holzer 001; Sebastian Jakobi (Int. J. Found. Comput. Sci., 2013)

Minimal and Hyper-Minimal Biautomata - (Extended Abstract). - Markus Holzer 001; Sebastian Jakobi (Developments in Language Theory, 2014)

More Structural Characterizations of Some Subregular Language Families by Biautomata. - Markus Holzer 001; Sebastian Jakobi (AFL, 2014)

Nondeterministic Biautomata and their Descriptional Complexity. - Markus Holzer 001; Sebastian Jakobi (Int. J. Found. Comput. Sci., 2014)

A Hierarchy of Fast Reversible Turing Machines. - Holger Bock Axelsen; Sebastian Jakobi; Martin Kutrib; Andreas Malcher (RC, 2015)

More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. - Hermann Gruber; Markus Holzer 001; Sebastian Jakobi (CIAA, 2015)

Minimization and Characterizations for Biautomata. - Markus Holzer 001; Sebastian Jakobi (Fundam. Informaticae, 2015)

Modern aspects of classical automata theory: finite automata, biautomata, and lossy compression. - Sebastian Jakobi (2015)

On the Computational Complexity of Partial Word Automata Problems. - Markus Holzer 001; Sebastian Jakobi; Matthias Wendlandt (Fundam. Informaticae, 2016)

Minimal and Hyper-Minimal Biautomata. - Markus Holzer 001; Sebastian Jakobi (Int. J. Found. Comput. Sci., 2016)

Boundary sets of regular and context-free languages. - Markus Holzer 001; Sebastian Jakobi (Theor. Comput. Sci., 2016)

Tight Bounds for Cut-Operations on Deterministic Finite Automata. - Frank Drewes; Markus Holzer 001; Sebastian Jakobi; Brink van der Merwe (Fundam. Informaticae, 2017)

More on Minimizing Finite Automata with Errors - Nondeterministic Machines. - Markus Holzer 001; Sebastian Jakobi (Int. J. Found. Comput. Sci., 2017)

More on deterministic and nondeterministic finite cover automata. - Hermann Gruber; Markus Holzer 001; Sebastian Jakobi (Theor. Comput. Sci., 2017)

The chop of languages. - Markus Holzer 001; Sebastian Jakobi; Martin Kutrib (Theor. Comput. Sci., 2017)

Computational Complexity of Decision Problems on Self-verifying Finite Automata. - Markus Holzer 001; Sebastian Jakobi; Jozef Jirásek Jr. (DLT, 2018)

On the computational complexity of problems related to distinguishability sets. - Markus Holzer 001; Sebastian Jakobi (Inf. Comput., 2018)

Minimal Reversible Deterministic Finite Automata. - Markus Holzer 001; Sebastian Jakobi; Martin Kutrib (Int. J. Found. Comput. Sci., 2018)

A comment on strong language families and self-verifying complexity classes. - Markus Holzer 001; Sebastian Jakobi (NCMA, 2019)

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