| Publication | Date of Publication | Type |
|---|
The ranges of state and accepting state complexities for the cut operation
Theoretical Computer Science | 2026-08-25 | Paper |
More on the descriptional complexity of products of finite automata
International Journal of Foundations of Computer Science | 2026-08-20 | Paper |
Optimal regular expressions for palindromes of given length
Information and Computation | 2026-06-23 | Paper |
On Jaffe's pumping lemma, revisited
Information and Computation | 2026-03-20 | Paper |
The pumping lemma for regular languages is hard
International Journal of Foundations of Computer Science | 2026-02-17 | Paper |
| More on language families with a decidable pumping-problem (extended abstract) | 2026-02-10 | Paper |
| On pumping constants and smallest grammars for context-free languages | 2026-01-08 | Paper |
On the complexity of rolling block, colour, and Alice mazes
Journal of Automata, Languages and Combinatorics | 2025-11-01 | Paper |
| On switching finite state automata | 2025-04-15 | Paper |
| The pumping lemma for context-free languages is undecidable | 2025-01-31 | Paper |
| On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract) | 2025-01-20 | Paper |
Development of a central-moment phase-field lattice Boltzmann model for thermocapillary flows: droplet capture and computational performance
Journal of Computational Physics | 2024-10-08 | Paper |
On Minimal Pumping Constants for Regular Languages
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
The pumping lemma for regular languages is hard
Implementation and Application of Automata | 2024-02-28 | Paper |
| On the accepting state complexity of operations on permutation automata | 2024-02-06 | Paper |
On the complexity of intersection non-emptiness for star-free language classes
(available as arXiv preprint) | 2024-02-05 | Paper |
On the accepting state complexity of operations on permutation automata
RAIRO - Theoretical Informatics and Applications | 2024-02-02 | Paper |
Computational complexity of reversible reaction systems
Reversible Computation | 2024-01-11 | Paper |
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
International Journal of Foundations of Computer Science | 2023-11-24 | Paper |
Advanced Automatic Code Generation for Multiple Relaxation-Time Lattice Boltzmann Methods
SIAM Journal on Scientific Computing | 2023-09-08 | Paper |
On Jaffe's pumping lemma, revisited
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 |
| Optimal Regular Expressions for Palindromes of Given Length | 2023-08-08 | Paper |
| On the descriptional complexity of the direct product of finite automata | 2023-01-18 | Paper |
Comparison of free-surface and conservative Allen-Cahn phase-field lattice Boltzmann method
Journal of Computational Physics | 2022-11-29 | Paper |
| More on the descriptional complexity of products of finite automata | 2022-11-09 | Paper |
Parallel complexity of iterated morphisms and the arithmetic of small numbers
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Inductive counting below LOGSPACE
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| On 25 years of CIAA through the lens of data science | 2022-08-16 | Paper |
| Semicomputable points in Euclidean spaces | 2022-07-21 | Paper |
| On minimizing regular expressions without Kleene star | 2022-05-20 | Paper |
| The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) | 2022-03-25 | Paper |
| The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) | 2022-03-22 | Paper |
| On the computational complexity of reaction systems, revisited | 2022-03-21 | Paper |
Nondeterministic right one-way jumping finite automata
Information and Computation | 2022-03-14 | Paper |
| Descriptional complexity of regular languages | 2022-02-04 | 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 |
Two-Sided Strictly Locally Testable Languages
Fundamenta Informaticae | 2021-11-15 | Paper |
On the number of active states in finite automata
Acta Informatica | 2021-07-23 | Paper |
| From finite automata to regular expressions and back -- a summary on descriptional complexity | 2021-06-22 | Paper |
Cooperating distributed grammar systems of finite index working in hybrid modes
(available as arXiv preprint) | 2021-06-22 | Paper |
| Cooperating distributed grammar systems of finite index working in hybrid modes | 2021-06-22 | Paper |
More structural characterizations of some subregular language families by biautomata
(available as arXiv preprint) | 2021-06-22 | Paper |
| More structural characterizations of some subregular language families by biautomata | 2021-06-22 | Paper |
| Automata that may change their mind | 2021-05-12 | Paper |
Decidability of right one-way jumping finite automata
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The ranges of accepting state complexities of languages resulting from some operations
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
| The magic number problem for subregular language families | 2021-02-24 | Paper |
| scientific article; zbMATH DE number 7301306 (Why is no real title available?) | 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 |
| Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms | 2020-08-11 | Paper |
Properties of right one-way jumping finite automata
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
| On the grammatical complexity of finite languages | 2020-06-30 | Paper |
| Nondeterministic right one-way jumping finite automata (extended abstract) | 2020-05-12 | Paper |
| Non-recursive trade-offs are ``almost everywhere'' | 2020-05-12 | Paper |
| Semi-linear lattices and right one-way jumping finite automata (extended abstract) | 2020-05-06 | Paper |
One-time nondeterministic computations
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
| The range of state complexities of languages resulting from the cut operation | 2019-12-04 | Paper |
Properties of right one-way jumping finite automata
Theoretical Computer Science | 2019-11-07 | Paper |
A mesh of automata
Information and Computation | 2019-09-17 | Paper |
On bonded sequential and parallel insertion systems
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Operational state complexity and decidability of jumping finite automata
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
| Decidability of right one-way jumping finite automata | 2018-11-22 | Paper |
| On minimal grammar problems for finite languages | 2018-11-22 | Paper |
| Computational complexity of decision problems on self-verifying finite automata | 2018-11-22 | Paper |
| The ranges of accepting state complexities of languages resulting from some operations | 2018-11-07 | Paper |
Structure and Complexity of Some Subregular Language Families
The Role of Theory in Computer Science | 2018-09-20 | 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 |
| Reversible nondeterministic finite automata | 2018-03-16 | Paper |
The degree of irreversibility in deterministic finite automata
International Journal of Foundations of Computer Science | 2018-02-22 | 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 |
| On regular expression proof complexity | 2017-10-13 | Paper |
| Operational state complexity and decidability of jumping finite automata | 2017-10-13 | Paper |
| On the mother of all automata: the position automaton | 2017-10-13 | Paper |
| One-time nondeterministic computations | 2017-08-31 | Paper |
| On the number of active states in deterministic and nondeterministic finite automata | 2017-08-22 | 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 |
| Self-assembling pushdown automata | 2016-12-16 | Paper |
The degree of irreversibility in deterministic finite automata
Implementation and Application of Automata | 2016-11-09 | Paper |
On measuring non-recursive trade-offs
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Hairpin finite automata
Journal of Automata, Languages and Combinatorics | 2016-09-29 | 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 |
On a hierarchy of languages generated by cooperating distributed grammar systems
Information Processing Letters | 2016-06-16 | Paper |
Minimization and characterizations for biautomata
Fundamenta Informaticae | 2016-05-11 | Paper |
From finite automata to regular expressions and back -- a summary on descriptional complexity
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
The finite index restriction meets hybrid modes in cooperating distributed grammar systems
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Reversible shrinking two-pushdown automata
Language and Automata Theory and Applications | 2016-04-13 | 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 |
