| Publication | Date of Publication | Type |
|---|
The descriptional power of queue automata of constant length
Acta Informatica | 2021-07-23 | Paper |
| More structural characterizations of some subregular language families by biautomata | 2021-06-22 | Paper |
More structural characterizations of some subregular language families by biautomata
(available as arXiv preprint) | 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
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
On the computational complexity of problems related to distinguishability sets
Information and Computation | 2018-03-21 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Fundamenta Informaticae | 2018-01-19 | Paper |
On the Computational Complexity of Partial Word Automata Problems
Fundamenta Informaticae | 2017-11-09 | Paper |
More on Minimizing Finite Automata with Errors — Nondeterministic Machines
International Journal of Foundations of Computer Science | 2017-06-20 | Paper |
More on deterministic and nondeterministic finite cover automata
Theoretical Computer Science | 2017-06-19 | Paper |
The chop of languages
Theoretical Computer Science | 2017-06-15 | Paper |
A hierarchy of fast reversible Turing machines
Reversible Computation | 2016-09-30 | Paper |
| The chop of languages | 2016-07-26 | Paper |
Minimal and hyper-minimal biautomata
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
Minimization and characterizations for biautomata
Fundamenta Informaticae | 2016-05-11 | Paper |
Boundary sets of regular and context-free languages
Theoretical Computer Science | 2015-12-10 | Paper |
Minimal reversible deterministic finite automata
Developments in Language Theory | 2015-11-10 | Paper |
More on deterministic and nondeterministic finite cover automata (extended abstract)
Implementation and Application of Automata | 2015-09-23 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On the computational complexity of problems related to distinguishability sets
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
| scientific article; zbMATH DE number 6415494 (Why is no real title available?) | 2015-03-16 | Paper |
| Descriptional complexity of chop operations on unary and finite languages | 2015-03-16 | Paper |
Nondeterministic biautomata and their descriptional complexity
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Minimal and hyper-minimal biautomata (extended abstract)
Developments in Language Theory | 2014-10-14 | Paper |
Boundary sets of regular and context-free languages
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Queue automata of constant length
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Nondeterministic biautomata and their descriptional complexity
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
Implementation and Application of Automata | 2013-08-07 | Paper |
From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)
Developments in Language Theory | 2012-11-02 | Paper |
Generalized derivations with synchronized context-free grammars
Developments in Language Theory | 2012-11-02 | Paper |
State complexity of chop operations on unary and finite languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
On inverse operations and their descriptional complexity
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
The magic number problem for subregular language families
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Chop operations and expressions: descriptional complexity considerations
Developments in Language Theory | 2011-07-29 | Paper |
