Sebastian Jakobi

Publication Activity (10 Years)

Years Active: 2010-2021
Publications (10 Years): 12

Top Venues

Int. J. Found. Comput. Sci.

DCFS

Developments in Language Theory

Fundam. Informaticae

Justus Liebig University Giessen (PHD)

Education History

Justus Liebig University Giessen

PHD

Publications

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

Sebastian Jakobi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Jakobi