| Publication | Date of Publication | Type |
|---|
| Push complexity: optimal bounds and unary inputs | 2025-01-20 | Paper |
| Performing regular operations with 1-limited automata | 2024-07-29 | Paper |
| Once-Marking and Always-Marking 1-Limited Automata | 2024-04-09 | Paper |
| Two-way machines and de Bruijn words | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6190885 | 2024-02-06 | Paper |
| Usefulness of information and decomposability of unary regular languages | 2024-02-02 | Paper |
| Pushdown and one-counter automata: constant and non-constant memory usage | 2023-08-17 | Paper |
| Weakly and Strongly Irreversible Regular Languages | 2023-08-15 | Paper |
| Weight-reducing Turing machines | 2023-05-19 | Paper |
| Pushdown automata and constant height: decidability and bounds | 2023-05-16 | Paper |
| How hard is to compute the edit distance | 2022-12-09 | Paper |
| Converting nondeterministic two-way automata into small deterministic linear-time machines | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867525 | 2022-09-14 | Paper |
| On languages accepted with simultaneous complexity bounds and their ranking problem | 2022-08-18 | Paper |
| Performing regular operations with 1-limited automata | 2022-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016365 | 2021-12-13 | Paper |
| Non-Self-Embedding Grammars and Descriptional Complexity | 2021-11-15 | Paper |
| Usefulness of information and unary languages | 2021-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986301 | 2021-04-27 | Paper |
| Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata | 2021-04-19 | Paper |
| Pushdown automata and constant height: decidability and bounds | 2020-05-12 | Paper |
| Limited automata: properties, complexity and variants | 2020-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967154 | 2019-07-03 | Paper |
| Limited automata and unary languages | 2019-05-02 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4609331 | 2018-03-29 | Paper |
| Descriptional complexity of limited automata | 2018-03-21 | Paper |
| Strongly Limited Automata | 2017-11-09 | Paper |
| Limited automata and unary languages | 2017-10-13 | Paper |
| Obituary: Alberto Bertoni: a scientist and a friend | 2017-03-16 | Paper |
| Optimal state reductions of automata with partially specified behaviors | 2016-12-19 | Paper |
| Minimal and Reduced Reversible Automata | 2016-11-09 | Paper |
| Limited automata and context-free languages | 2016-05-11 | Paper |
| Restricted Turing Machines and Language Recognition | 2016-04-13 | Paper |
| Investigations on Automata and Languages Over a Unary Alphabet | 2016-02-17 | Paper |
| Universal Disjunctive Concatenation and Star | 2015-08-07 | Paper |
| Two-way automata characterizations of L/poly versus NL | 2015-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178448 | 2015-03-16 | Paper |
| Optimal State Reductions of Automata with Partially Specified Behaviors | 2015-02-20 | Paper |
| LIMITED AUTOMATA AND REGULAR LANGUAGES | 2015-02-09 | Paper |
| Two-way automata making choices only at the endmarkers | 2014-11-28 | Paper |
| Investigations on Automata and Languages over a Unary Alphabet | 2014-09-26 | Paper |
| Operational State Complexity under Parikh Equivalence | 2014-08-07 | Paper |
| Oblivious two-way finite automata: decidability and complexity | 2014-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747095 | 2014-02-11 | Paper |
| Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata | 2013-12-19 | Paper |
| Descriptional complexity of bounded context-free languages | 2013-12-04 | Paper |
| Limited Automata and Regular Languages | 2013-08-09 | Paper |
| Normal forms for unary probabilistic automata | 2012-11-22 | Paper |
| On Inverse Operations and Their Descriptional Complexity | 2012-11-02 | Paper |
| Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata | 2012-11-02 | Paper |
| Reversal Hierarchies for Small 2DFAs | 2012-09-25 | Paper |
| Two-Way Automata Characterizations of L/poly versus NL | 2012-09-10 | Paper |
| Oblivious Two-Way Finite Automata: Decidability and Complexity | 2012-06-29 | Paper |
| Parikh’s Theorem and Descriptional Complexity | 2012-06-15 | Paper |
| Two-way automata making choices only at the endmarkers | 2012-06-08 | Paper |
| On the size of unary probabilistic and nondeterministic automata | 2012-05-04 | Paper |
| Pairs of complementary unary languages with ``balanced nondeterministic automata | 2012-04-26 | Paper |
| Optimal simulation of self-verifying automata by deterministic automata | 2011-07-27 | Paper |
| Two-way unary automata versus logarithmic space | 2011-07-18 | Paper |
| One Pebble Versus ϵ · log n Bits | 2011-05-18 | Paper |
| Two-Way Unary Automata versus Logarithmic Space | 2010-08-31 | Paper |
| Strong optimal lower bounds for Turing machines that accept nonregular languages | 2010-06-17 | Paper |
| Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata | 2010-04-27 | Paper |
| A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES | 2010-01-29 | Paper |
| DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES | 2009-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5192993 | 2009-08-10 | Paper |
| Converting Self-verifying Automata into Deterministic Automata | 2009-04-02 | Paper |
| Deterministic Pushdown Automata and Unary Languages | 2009-02-12 | Paper |
| Descriptional Complexity of Bounded Context-Free Languages | 2007-11-28 | Paper |
| Complementing two-way finite automata | 2007-08-23 | Paper |
| String distances and intrusion detection: Bridging the gap between formal languages and computer security | 2007-04-10 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION | 2005-06-22 | Paper |
| Complementing unary nondeterministic automata | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453217 | 2004-03-07 | Paper |
| Converting two-way nondeterministic unary automata into simpler automata. | 2003-08-17 | Paper |
| Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. | 2003-05-14 | Paper |
| Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785462 | 2003-02-25 | Paper |
| Simulating finite automata with context-free grammars. | 2003-01-21 | Paper |
| How hard is computing the edit distance? | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536396 | 2002-11-04 | Paper |
| Distances between languages and reflexivity of relations | 2002-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540972 | 2002-07-28 | Paper |
| Optimal simulations between unary automata | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503152 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699296 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266544 | 1999-10-03 | Paper |
| Sublogarithmic Bounds on Space and Reversals | 1998-09-21 | Paper |
| A remark on middle space bounded alternating Turing machines | 1997-02-27 | Paper |
| Probabilistic asynchronous automata | 1996-07-01 | Paper |
| Corrigendum to ``An optimal lower bound for nonregular languages | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311851 | 1995-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288286 | 1995-01-02 | Paper |
| Asynchronous automata versus asynchronous cellular automata | 1994-09-25 | Paper |
| An optimal lower bound for nonregular languages | 1994-07-21 | Paper |
| The complexity of computing maximal word functions | 1994-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273666 | 1994-01-13 | Paper |
| On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787509 | 1988-01-01 | Paper |
