| Publication | Date of Publication | Type |
|---|
| Two-way automata and bounded languages | 2026-02-10 | Paper |
| Nondeterminism makes unary 1-limited automata concise | 2026-02-10 | Paper |
| Block languages and their bitmap representations | 2025-01-20 | Paper |
| Regular languages: to finite automata and beyond (invited talk) | 2024-08-13 | Paper |
Performing regular operations with 1-limited automata
Theory of Computing Systems | 2024-07-29 | Paper |
Once-Marking and Always-Marking 1-Limited Automata
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Two-way machines and de Bruijn words
Implementation and Application of Automata | 2024-02-28 | Paper |
Pushdown and one-counter automata: constant and non-constant memory usage
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Space Complexity of Stack Automata Models
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Weakly and Strongly Irreversible Regular Languages
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Magic Numbers in Periodic Sequences
Lecture Notes in Computer Science | 2023-07-25 | Paper |
| scientific article; zbMATH DE number 7699973 (Why is no real title available?) | 2023-06-22 | Paper |
Weight-reducing Turing machines
Information and Computation | 2023-05-19 | Paper |
Pushdown automata and constant height: decidability and bounds
Acta Informatica | 2023-05-16 | Paper |
Converting nondeterministic two-way automata into small deterministic linear-time machines
Information and Computation | 2022-12-08 | Paper |
Space complexity of stack automata models
Developments in Language Theory | 2022-10-13 | Paper |
| scientific article; zbMATH DE number 7584604 (Why is no real title available?) | 2022-09-14 | Paper |
| Performing regular operations with 1-limited automata | 2022-08-11 | Paper |
| Boolean kernels of context-free languages | 2022-03-22 | Paper |
| scientific article; zbMATH DE number 7444007 (Why is no real title available?) | 2021-12-13 | Paper |
scientific article; zbMATH DE number 7444007 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-13 | Paper |
Reversible pushdown transducers
Information and Computation | 2021-11-25 | Paper |
Non-self-embedding grammars and descriptional complexity
Fundamenta Informaticae | 2021-11-15 | Paper |
Non-self-embedding grammars, constant-height pushdown automata, and limited automata
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Linear-time limited automata
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
| Pushdown automata and constant height: decidability and bounds | 2020-05-12 | Paper |
Concise representations of reversible automata
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Linear-time limited automata
Theoretical Computer Science | 2019-11-07 | Paper |
Limited automata and unary languages
Information and Computation | 2019-05-02 | Paper |
Reversible pushdown transducers
Developments in Language Theory | 2018-11-22 | Paper |
| Two-way automata and one-tape machines. Read only versus linear time | 2018-11-22 | Paper |
| Non-self-embedding grammars, constant-height pushdown automata, and limited automata | 2018-11-07 | Paper |
| Minimal and reduced reversible automata | 2018-03-29 | Paper |
Limited automata and unary languages
Developments in Language Theory | 2017-10-13 | Paper |
| Concise representations of reversible automata | 2017-08-31 | Paper |
Minimal and Reduced Reversible Automata
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
