Sebastian Jakobi

According to our database, Sebastian Jakobi authored at least 32 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

The descriptional power of queue automata of constant length.

Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano

Acta Informatica, 2021

2019

A comment on strong language families and self-verifying complexity classes.

Markus Holzer, Sebastian Jakobi

Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

2018

Minimal Reversible Deterministic Finite Automata.

Markus Holzer, Sebastian Jakobi, Martin Kutrib

Int. J. Found. Comput. Sci., 2018

On the computational complexity of problems related to distinguishability sets.

Markus Holzer, Sebastian Jakobi

Inf. Comput., 2018

Computational Complexity of Decision Problems on Self-verifying Finite Automata.

Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

The chop of languages.

Markus Holzer, Sebastian Jakobi, Martin Kutrib

Theor. Comput. Sci., 2017

More on deterministic and nondeterministic finite cover automata.

Hermann Gruber, Markus Holzer, Sebastian Jakobi

Theor. Comput. Sci., 2017

More on Minimizing Finite Automata with Errors - Nondeterministic Machines.

Markus Holzer, Sebastian Jakobi

Int. J. Found. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.

Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe

Fundam. Informaticae, 2017

2016

Boundary sets of regular and context-free languages.

Markus Holzer, Sebastian Jakobi

Theor. Comput. Sci., 2016

Minimal and Hyper-Minimal Biautomata.

Markus Holzer, Sebastian Jakobi

Int. J. Found. Comput. Sci., 2016

On the Computational Complexity of Partial Word Automata Problems.

Markus Holzer, Sebastian Jakobi, Matthias Wendlandt

Fundam. Informaticae, 2016

2015

Modern aspects of classical automata theory: finite automata, biautomata, and lossy compression.

Sebastian Jakobi

PhD thesis, 2015

Minimization and Characterizations for Biautomata.

Markus Holzer, Sebastian Jakobi

Fundam. Informaticae, 2015

More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract.

Hermann Gruber, Markus Holzer, Sebastian Jakobi

Proceedings of the Implementation and Application of Automata, 2015

A Hierarchy of Fast Reversible Turing Machines.

Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher

Proceedings of the Reversible Computation - 7th International Conference, 2015

2014

Nondeterministic Biautomata and their Descriptional Complexity.

Markus Holzer, Sebastian Jakobi

Int. J. Found. Comput. Sci., 2014

More Structural Characterizations of Some Subregular Language Families by Biautomata.

Markus Holzer, Sebastian Jakobi

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Minimal and Hyper-Minimal Biautomata - (Extended Abstract).

Markus Holzer, Sebastian Jakobi

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors.

Markus Holzer, Sebastian Jakobi

Int. J. Found. Comput. Sci., 2013

Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract).

Markus Holzer, Sebastian Jakobi

Proceedings of the Implementation and Application of Automata, 2013

Queue Automata of Constant Length.

Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Descriptional Complexity of Chop Operations on Unary and Finite Languages.

Markus Holzer, Sebastian Jakobi

J. Autom. Lang. Comb., 2012

On Inverse Operations and Their Descriptional Complexity.

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini

J. Autom. Lang. Comb., 2012

The Magic Number Problem for Subregular Language Families.

Markus Holzer, Sebastian Jakobi, Martin Kutrib

Int. J. Found. Comput. Sci., 2012

Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes.

Markus Holzer, Sebastian Jakobi

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

On the Complexity of Rolling Block and Alice Mazes.

Markus Holzer, Sebastian Jakobi

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Generalized Derivations with Synchronized Context-Free Grammars.

Markus Holzer, Sebastian Jakobi, Ian McQuillan

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract).

Markus Holzer, Sebastian Jakobi

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

State Complexity of Chop Operations on Unary and Finite Languages.

Markus Holzer, Sebastian Jakobi

Proceedings of the Descriptional Complexity of Formal Systems, 2012

On Inverse Operations and Their Descriptional Complexity.

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

Chop Operations and Expressions: Descriptional Complexity Considerations.

Markus Holzer, Sebastian Jakobi

Proceedings of the Developments in Language Theory - 15th International Conference, 2011