Sebastian Jakobi

42 papers C 10Misc 2Journal 17Unranked 12
YearRankTypeTitle / Venue / Authors
2024 J jnl
On the Complexity of Rolling Block, Colour, and Alice Mazes.
J. Autom. Lang. Comb.
Markus Holzer, Sebastian Jakobi
2021 J jnl
The descriptional power of queue automata of constant length.
Acta Informatica
Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2019 — conf
A comment on strong language families and self-verifying complexity classes.
NCMA
Markus Holzer, Sebastian Jakobi
2018 C conf
Computational Complexity of Decision Problems on Self-verifying Finite Automata.
DLT
Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.
2018 J jnl
Minimal Reversible Deterministic Finite Automata.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi, Martin Kutrib
2018 J jnl
On the computational complexity of problems related to distinguishability sets.
Inf. Comput.
Markus Holzer, Sebastian Jakobi
2017 J jnl
More on Minimizing Finite Automata with Errors - Nondeterministic Machines.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi
2017 J jnl
More on deterministic and nondeterministic finite cover automata.
Theor. Comput. Sci.
Hermann Gruber, Markus Holzer, Sebastian Jakobi
2017 J jnl
The chop of languages.
Theor. Comput. Sci.
Markus Holzer, Sebastian Jakobi, Martin Kutrib
2017 J jnl
Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Fundam. Informaticae
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
2016 J jnl
Boundary sets of regular and context-free languages.
Theor. Comput. Sci.
Markus Holzer, Sebastian Jakobi
2016 J jnl
Minimal and Hyper-Minimal Biautomata.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi
2016 J jnl
On the Computational Complexity of Partial Word Automata Problems.
Fundam. Informaticae
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
2015 C conf
A Hierarchy of Fast Reversible Turing Machines.
RC
Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher
2015 C conf
Minimal Reversible Deterministic Finite Automata.
DLT
Markus Holzer, Sebastian Jakobi, Martin Kutrib
2015 J jnl
Minimization and Characterizations for Biautomata.
Fundam. Informaticae
Markus Holzer, Sebastian Jakobi
2015 — —
Modern aspects of classical automata theory: finite automata, biautomata, and lossy compression.
Sebastian Jakobi
2015 C conf
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract.
CIAA
Hermann Gruber, Markus Holzer, Sebastian Jakobi
2015 — conf
On the Computational Complexity of Problems Related to Distinguishability Sets.
DCFS
Markus Holzer, Sebastian Jakobi
2015 C conf
Tight Bounds for Cut-Operations on Deterministic Finite Automata.
MCU
Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe
2014 — conf
Boundary Sets of Regular and Context-Free Languages.
DCFS
Markus Holzer, Sebastian Jakobi
2014 C conf
Minimal and Hyper-Minimal Biautomata - (Extended Abstract).
Developments in Language Theory
Markus Holzer, Sebastian Jakobi
2014 — conf
More Structural Characterizations of Some Subregular Language Families by Biautomata.
AFL
Markus Holzer, Sebastian Jakobi
2014 J jnl
Nondeterministic Biautomata and their Descriptional Complexity.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi
2014 — conf
On the computational complexity of partial word automata problems.
NCMA
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
2013 C conf
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract).
CIAA
Markus Holzer, Sebastian Jakobi
2013 J jnl
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi
2013 — conf
Minimization and characterizations for biautomata.
NCMA
Markus Holzer, Sebastian Jakobi
2013 — conf
Nondeterministic Biautomata and Their Descriptional Complexity.
DCFS
Markus Holzer, Sebastian Jakobi
2013 — conf
Queue Automata of Constant Length.
DCFS
Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2012 J jnl
Descriptional Complexity of Chop Operations on Unary and Finite Languages.
J. Autom. Lang. Comb.
Markus Holzer, Sebastian Jakobi
2012 C conf
From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract).
Developments in Language Theory
Markus Holzer, Sebastian Jakobi
2012 C conf
Generalized Derivations with Synchronized Context-Free Grammars.
Developments in Language Theory
Markus Holzer, Sebastian Jakobi, Ian McQuillan
2012 Misc conf
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes.
FUN
Markus Holzer, Sebastian Jakobi
2012 — conf
On Inverse Operations and Their Descriptional Complexity.
DCFS
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
2012 J jnl
On Inverse Operations and Their Descriptional Complexity.
J. Autom. Lang. Comb.
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2012 Misc conf
On the Complexity of Rolling Block and Alice Mazes.
FUN
Markus Holzer, Sebastian Jakobi
2012 — conf
State Complexity of Chop Operations on Unary and Finite Languages.
DCFS
Markus Holzer, Sebastian Jakobi
2012 J jnl
The Magic Number Problem for Subregular Language Families.
Int. J. Found. Comput. Sci.
Markus Holzer, Sebastian Jakobi, Martin Kutrib
2011 C conf
Chop Operations and Expressions: Descriptional Complexity Considerations.
Developments in Language Theory
Markus Holzer, Sebastian Jakobi
2011 — conf
The Chop of Languages.
AFL
Markus Holzer, Sebastian Jakobi, Martin Kutrib
2010 — conf
The Magic Number Problem for Subregular Language Families
DCFS
Markus Holzer, Sebastian Jakobi, Martin Kutrib