| Publication | Date of Publication | Type |
|---|
State complexity of partial word finite automata
International Journal of Foundations of Computer Science | 2026-08-20 | Paper |
On properties of languages accepted by deterministic pushdown automata with translucent input letters
Theoretical Computer Science | 2026-04-16 | Paper |
Deterministic tree-walking-storage automata
Acta Informatica | 2026-03-16 | Paper |
Sweeping input-driven pushdown automata
International Journal of Foundations of Computer Science | 2026-02-17 | Paper |
| State-freezing pushdown automata | 2026-02-10 | Paper |
| Subregular expressions with two operations | 2026-02-10 | Paper |
Deterministic pushdown automata with translucent input letters
Information and Computation | 2026-02-02 | Paper |
| String assembling systems: origins and directions | 2026-01-08 | Paper |
| Two-way finite automata with translucent input letters | 2025-12-15 | Paper |
| Real-time pattern generation by one-dimensional cellular automata | 2025-12-03 | Paper |
Complexity of exclusive nondeterministic finite automata
Information and Computation | 2025-09-09 | Paper |
| Complexity of unary exclusive nondeterministic finite automata | 2025-08-19 | Paper |
| Deterministic real-time tree-walking-storage automata | 2025-08-19 | Paper |
Deterministic real-time tree-walking-storage automata
Acta Informatica | 2025-06-02 | Paper |
Kernels of context-free languages
International Journal of Foundations of Computer Science | 2025-04-30 | Paper |
| Cellular automata: communication matters | 2025-02-07 | Paper |
| Deterministic pushdown automata with translucent input letters | 2025-01-31 | Paper |
| Cellular automata: from black-and-white to high gloss color | 2025-01-31 | Paper |
| On properties of languages accepted by deterministic pushdown automata with translucent input letters | 2025-01-20 | Paper |
Reversible Computations of One-Way Counter Automata
RAIRO - Theoretical Informatics and Applications | 2024-04-16 | Paper |
Reversible Two-Party Computations
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
On the power of pushing or stationary moves for input-driven pushdown automata
Theoretical Computer Science | 2024-04-04 | Paper |
Sweeping input-driven pushdown automata
Implementation and Application of Automata | 2024-02-28 | Paper |
Iterative arrays with finite inter-cell communication
Natural Computing | 2024-02-16 | Paper |
Iterative arrays with self-verifying communication cell
Natural Computing | 2024-02-16 | Paper |
Shrinking one-way cellular automata
Natural Computing | 2024-02-09 | Paper |
Reversible computations of one-way counter automata
(available as arXiv preprint) | 2024-02-06 | Paper |
| Reversible computations of one-way counter automata | 2024-02-06 | Paper |
| 25 editions of DCFS: origins and directions | 2024-02-06 | Paper |
Revisiting the cutting of the firing squad synchronization
Natural Computing | 2023-11-30 | Paper |
| scientific article; zbMATH DE number 7770052 (Why is no real title available?) | 2023-11-23 | Paper |
Tree-walking-storage automata
Developments in Language Theory | 2023-11-16 | Paper |
One-dimensional pattern generation by cellular automata
Natural Computing | 2023-09-01 | Paper |
Complexity of exclusive nondeterministic finite automata
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Input-Driven Double-Head Pushdown Automata
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Reversible Top-Down Syntax Analysis
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Iterated uniform finite-state transducers on unary languages
Theoretical Computer Science | 2023-08-01 | Paper |
Self-verifying Cellular Automata
Developments in Language Theory | 2023-06-30 | Paper |
Syntax checking either way
Theoretical Computer Science | 2023-06-21 | Paper |
State complexity of finite partial languages
Theoretical Computer Science | 2023-06-21 | Paper |
| State complexity of finite partial languages | 2023-01-18 | Paper |
| Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power | 2022-12-16 | Paper |
| Optimizing reversible programs | 2022-11-11 | Paper |
| State complexity of partial word finite automata | 2022-11-09 | Paper |
| Reversible shrinking two-pushdown automata | 2022-09-14 | Paper |
| Syntax checking either way | 2022-08-16 | Paper |
| On the power of pushing or stationary moves for input-driven pushdown automata | 2022-08-16 | Paper |
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
Fundamenta Informaticae | 2022-07-14 | Paper |
| String assembling systems: comparison to sticker systems and decidability | 2022-07-06 | Paper |
Cellular Automata and Language Theory
Cellular Automata | 2022-04-28 | Paper |
Finite automata with undirected state graphs
Acta Informatica | 2022-04-01 | Paper |
| Reversible top-down syntax analysis | 2022-03-25 | Paper |
| One-dimensional pattern generation by cellular automata | 2022-03-24 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2022-03-24 | Paper |
| Boolean kernels of context-free languages | 2022-03-22 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Information and Computation | 2022-03-14 | Paper |
| Descriptional complexity of regular languages | 2022-02-04 | Paper |
Digging input-driven pushdown automata
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
On the descriptional complexity of operations on semilinear sets
(available as arXiv preprint) | 2021-12-13 | Paper |
| On the descriptional complexity of operations on semilinear sets | 2021-12-13 | Paper |
Input-driven double-head pushdown automata
(available as arXiv preprint) | 2021-12-13 | Paper |
| Input-driven double-head pushdown automata | 2021-12-13 | Paper |
Reversible pushdown transducers
Information and Computation | 2021-11-25 | Paper |
Self-verifying pushdown and queue automata
Fundamenta Informaticae | 2021-11-15 | Paper |
Two-Sided Strictly Locally Testable Languages
Fundamenta Informaticae | 2021-11-15 | Paper |
Compiling Janus to RSSA
Reversible Computation | 2021-11-03 | Paper |
String generation by cellular automata
Complex Systems | 2021-09-08 | Paper |
| Self-verifying cellular automata | 2021-08-25 | Paper |
| Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion | 2021-07-14 | Paper |
| Cellular string generators | 2021-07-08 | Paper |
Measuring communication in parallel communicating finite automata
(available as arXiv preprint) | 2021-06-22 | Paper |
| Measuring communication in parallel communicating finite automata | 2021-06-22 | Paper |
Input-driven multi-counter automata
Theoretical Computer Science | 2021-06-03 | Paper |
| Automata that may change their mind | 2021-05-12 | Paper |
| On two-sided locally testable languages | 2021-05-12 | Paper |
Transductions computed by one-dimensional cellular automata
(available as arXiv preprint) | 2021-04-27 | Paper |
| Transductions computed by one-dimensional cellular automata | 2021-04-27 | Paper |
Boosting reversible pushdown and queue machines by preprocessing
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
| The magic number problem for subregular language families | 2021-02-24 | Paper |
| On the number of membranes in unary P systems | 2021-01-26 | Paper |
| scientific article; zbMATH DE number 7301306 (Why is no real title available?) | 2021-01-26 | Paper |
| Bounded languages meet cellular automata with sparse communication | 2021-01-26 | Paper |
Multi-head finite automata: characterizations, concepts and open problems
(available as arXiv preprint) | 2021-01-20 | Paper |
| Multi-head finite automata: characterizations, concepts and open problems | 2021-01-20 | Paper |
| Multi-stranded string assembling systems | 2020-10-22 | Paper |
Kernels of sub-classes of context-free languages
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Finite automata with undirected state graphs
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
Cellular automata: descriptional complexity and decidability
Reversibility and Universality | 2020-05-28 | Paper |
Queue Automata: Foundations and Developments
Reversibility and Universality | 2020-05-28 | Paper |
| Non-recursive trade-offs are ``almost everywhere'' | 2020-05-12 | Paper |
Descriptional complexity of iterated uniform finite-state transducers
Descriptional Complexity of Formal Systems | 2020-05-12 | Paper |
Input-driven multi-counter automata
Implementation and Application of Automata | 2020-05-06 | Paper |
| Iterative arrays with set storage | 2020-03-12 | Paper |
One-time nondeterministic computations
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
| Iterative arrays with finite inter-cell communication | 2019-12-05 | Paper |
| Iterative arrays with self-verifying communication cell | 2019-12-05 | Paper |
Transducing reversibly with finite state machines
Theoretical Computer Science | 2019-08-20 | Paper |
Diving into the queue
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Expressive capacity of subregular expressions
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
| Recent trends in descriptional complexity of formal languages | 2019-07-03 | Paper |
Operational state complexity and decidability of jumping finite automata
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Reversible pushdown transducers
Developments in Language Theory | 2018-11-22 | Paper |
| Boosting pushdown and queue machines by preprocessing | 2018-11-07 | Paper |
| Parametrizing string assembling systems | 2018-11-07 | Paper |
Structure and Complexity of Some Subregular Language Families
The Role of Theory in Computer Science | 2018-09-20 | Paper |
Cutting the Firing Squad Synchronization
Lecture Notes in Computer Science | 2018-07-06 | Paper |
