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
https://portal.mardi4nfdi.de/entity/Q4994950	2021-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q4964015	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
https://portal.mardi4nfdi.de/entity/Q5740421	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	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	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	2013-08-07	Paper
From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors	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