| Publication | Date of Publication | Type |
|---|
| Binary coded unary regular languages | 2024-02-28 | Paper |
| State complexity of binary coded regular languages | 2024-02-20 | Paper |
| State complexity of binary coded regular languages | 2023-01-18 | Paper |
| Deterministic one-way simulation of two-way deterministic finite automata over small alphabets | 2022-11-09 | Paper |
| Improved complement for two-way alternating automata | 2022-09-26 | Paper |
| Input-driven pushdown automata for edit distance neighborhood | 2022-05-10 | Paper |
| Minimal Size of Counters for (Real-Time) Multicounter Automata | 2021-10-25 | Paper |
| Complement for two-way alternating automata | 2021-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146523 | 2021-01-26 | Paper |
| Input-driven pushdown automata for edit distance neighborhood | 2019-10-15 | Paper |
| Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) | 2019-07-04 | Paper |
| Complement for two-way alternating automata | 2018-11-28 | Paper |
| Minimal useful size of counters for (real-time) multicounter automata | 2018-06-26 | Paper |
| Boolean language operations on nondeterministic automata with a pushdown of constant height | 2017-09-15 | Paper |
| Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) | 2017-08-22 | Paper |
| Alternating space is closed under complement and other simulations for sublogarithmic space | 2017-03-16 | Paper |
| Two double-exponential gaps for automata with a limited pushdown | 2017-03-16 | Paper |
| Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space | 2016-08-30 | Paper |
| New Results on the Minimum Amount of Useful Space | 2016-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455037 | 2015-12-03 | Paper |
| Two-way automata making choices only at the endmarkers | 2014-11-28 | Paper |
| Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata | 2014-10-14 | Paper |
| Classical Automata on Promise Problems | 2014-08-07 | Paper |
| UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(log log n) | 2014-08-04 | Paper |
| Removing nondeterminism in constant height pushdown automata | 2014-07-18 | Paper |
| Two Double-Exponential Gaps for Automata with a Limited Pushdown | 2014-03-31 | Paper |
| Factoring and testing primes in small space | 2014-02-24 | Paper |
| A Direct Construction of Finite State Automata for Pushdown Store Languages | 2013-08-09 | Paper |
| Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height | 2013-06-14 | Paper |
| Unary Coded NP-Complete Languages in ASPACE (log log n) | 2012-11-02 | Paper |
| Removing Nondeterminism in Constant Height Pushdown Automata | 2012-11-02 | Paper |
| The size-cost of Boolean operations on constant height deterministic pushdown automata | 2012-08-13 | Paper |
| An alternating hierarchy for finite automata | 2012-08-10 | Paper |
| Two-way automata making choices only at the endmarkers | 2012-06-08 | Paper |
| Pairs of complementary unary languages with ``balanced nondeterministic automata | 2012-04-26 | Paper |
| The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata | 2011-07-29 | Paper |
| Two-way unary automata versus logarithmic space | 2011-07-18 | Paper |
| One Pebble Versus ϵ · log n Bits | 2011-05-18 | Paper |
| Translation from classical two-way automata to pebble two-way automata | 2011-05-10 | Paper |
| In-Place Sorting | 2011-02-15 | Paper |
| Two-Way Unary Automata versus Logarithmic Space | 2010-08-31 | Paper |
| Bridging across the log(n) space frontier | 2010-06-17 | Paper |
| Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata | 2010-04-27 | Paper |
| Multiway in-place merging | 2010-04-15 | Paper |
| More concise representation of regular languages by automata and regular expressions | 2010-04-08 | Paper |
| Multiway In-Place Merging | 2009-10-20 | Paper |
| Factoring and Testing Primes in Small Space | 2009-02-03 | Paper |
| Hyper-minimizing minimized deterministic finite state automata | 2008-12-22 | Paper |
| An in-place sorting with O ( n log n ) comparisons and O ( n ) moves | 2008-12-21 | Paper |
| More Concise Representation of Regular Languages by Automata and Regular Expressions | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517099 | 2008-08-12 | Paper |
| Magic numbers in the state hierarchy of finite automata | 2007-11-21 | Paper |
| Magic Numbers in the State Hierarchy of Finite Automata | 2007-09-05 | Paper |
| Complementing two-way finite automata | 2007-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3435060 | 2007-05-04 | Paper |
| Conversion of regular expressions into realtime automata | 2007-02-20 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4680180 | 2005-10-07 | Paper |
| Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions | 2003-08-19 | Paper |
| Space hierarchy theorem revised. | 2003-08-17 | Paper |
| Converting two-way nondeterministic unary automata into simpler automata. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785461 | 2003-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785462 | 2003-02-25 | Paper |
| A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines | 2001-06-26 | Paper |
| A variant of inductive counting | 2000-06-04 | Paper |
| Asymptotically efficient in-place merging | 2000-06-04 | Paper |
| Bridging across the \(\log(n)\) space frontier | 1998-11-10 | Paper |
| Sublogarithmic Bounds on Space and Reversals | 1998-09-21 | Paper |
| A communication hierarchy of parallel computations | 1998-08-13 | Paper |
| A hierarchy that does not collapse : alternations in low level space | 1997-10-30 | Paper |
| A speed-up theorem without tape compression | 1993-12-06 | Paper |
| Sublogarithmic $\sum _2$-space is not closed under complement and other separation results | 1993-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038686 | 1993-05-18 | Paper |
| Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space | 1993-05-16 | Paper |
| A lower bound for the nondeterministic space complexity of context-free recognition | 1993-01-16 | Paper |
| Normal forms for phrase-structure grammars | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980380 | 1992-06-26 | Paper |
| Nondeterministic Computations in Sublogarithmic Space and Space Constructibility | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359748 | 1990-01-01 | Paper |
| A representation of recursively enumerable languages by two homomorphisms and a quotient | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798273 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751035 | 1986-01-01 | Paper |
