Sebastian Jakobi

Available identifiers

zbMath Open jakobi.sebastianMaRDI QIDQ896679

List of research outcomes

Publication	Date of Publication	Type
The descriptional power of queue automata of constant length	2021-07-23	Paper
More structural characterizations of some subregular language families by biautomata	2021-06-22	Paper
The magic number problem for subregular language families	2021-02-24	Paper
Computational complexity of decision problems on self-verifying finite automata	2018-11-22	Paper
Minimal reversible deterministic finite automata	2018-05-15	Paper
On the computational complexity of problems related to distinguishability sets	2018-03-21	Paper
Tight bounds for cut-operations on deterministic finite automata	2018-01-19	Paper
On the Computational Complexity of Partial Word Automata Problems	2017-11-09	Paper
More on Minimizing Finite Automata with Errors — Nondeterministic Machines	2017-06-20	Paper
More on deterministic and nondeterministic finite cover automata	2017-06-19	Paper
The chop of languages	2017-06-15	Paper
A hierarchy of fast reversible Turing machines	2016-09-30	Paper
The chop of languages	2016-07-26	Paper
Minimal and hyper-minimal biautomata	2016-06-23	Paper
Minimization and characterizations for biautomata	2016-05-11	Paper
Boundary sets of regular and context-free languages	2015-12-10	Paper
Minimal reversible deterministic finite automata	2015-11-10	Paper
More on deterministic and nondeterministic finite cover automata (extended abstract)	2015-09-23	Paper
Tight bounds for cut-operations on deterministic finite automata	2015-09-15	Paper
On the computational complexity of problems related to distinguishability sets	2015-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q5178448	2015-03-16	Paper
Descriptional complexity of chop operations on unary and finite languages	2015-03-16	Paper
Nondeterministic biautomata and their descriptional complexity	2015-02-09	Paper
Minimal and hyper-minimal biautomata (extended abstract)	2014-10-14	Paper
Boundary sets of regular and context-free languages	2014-08-07	Paper
FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS	2014-08-04	Paper
Queue automata of constant length	2013-08-09	Paper
Nondeterministic biautomata and their descriptional complexity	2013-08-09	Paper
Brzozowski's minimization algorithm -- more robust than expected (extended abstract)	2013-08-07	Paper
From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)	2012-11-02	Paper
Generalized derivations with synchronized context-free grammars	2012-11-02	Paper
State complexity of chop operations on unary and finite languages	2012-11-02	Paper
On inverse operations and their descriptional complexity	2012-11-02	Paper
The magic number problem for subregular language families	2012-08-30	Paper
Chop operations and expressions: descriptional complexity considerations	2011-07-29	Paper

Research outcomes over time

This page was built for person: Sebastian Jakobi