| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6070604 | 2023-11-23 | Paper |
| Uniform circle formation for swarms of opaque robots with lights | 2023-08-02 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2023-08-01 | Paper |
| Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power | 2022-12-16 | Paper |
| On languages accepted with simultaneous complexity bounds and their ranking problem | 2022-08-18 | Paper |
| Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* | 2022-07-14 | Paper |
| Iterated uniform finite-state transducers on unary languages | 2022-03-24 | Paper |
| Descriptional complexity of iterated uniform finite-state transducers | 2022-03-14 | Paper |
| The descriptional power of queue automata of constant length | 2021-07-23 | Paper |
| Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion | 2021-07-14 | Paper |
| Descriptional complexity of iterated uniform finite-state transducers | 2020-05-12 | Paper |
| Boolean language operations on nondeterministic automata with a pushdown of constant height | 2017-09-15 | Paper |
| Quantum finite automata: advances on Bertoni's ideas | 2017-03-16 | Paper |
| On the Power of One-Way Automata with Quantum and Classical States | 2016-02-17 | Paper |
| Complexity of Promise Problems on Classical and Quantum Automata | 2015-09-08 | Paper |
| Deterministic input-driven queue automata: finite turns, decidability, and closure properties | 2015-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178448 | 2015-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178456 | 2015-03-16 | Paper |
| On the Power of One-Way Automata with Quantum and Classical States | 2014-09-26 | Paper |
| Size lower bounds for quantum automata | 2014-08-29 | Paper |
| Removing nondeterminism in constant height pushdown automata | 2014-07-18 | Paper |
| A Direct Construction of Finite State Automata for Pushdown Store Languages | 2013-08-09 | Paper |
| Queue Automata of Constant Length | 2013-08-09 | Paper |
| Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties | 2013-08-07 | Paper |
| Size Lower Bounds for Quantum Automata | 2013-06-28 | Paper |
| Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height | 2013-06-14 | Paper |
| Removing Nondeterminism in Constant Height Pushdown Automata | 2012-11-02 | Paper |
| Descriptional Complexity of Pushdown Store Languages | 2012-11-02 | Paper |
| First-order logics: some characterizations and closure properties | 2012-10-15 | Paper |
| The size-cost of Boolean operations on constant height deterministic pushdown automata | 2012-08-13 | Paper |
| Descriptional complexity of two-way pushdown automata with restricted head reversals | 2012-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2882386 | 2012-05-04 | Paper |
| The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata | 2011-07-29 | Paper |
| Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3018968 | 2011-07-27 | Paper |
| One Pebble Versus ϵ · log n Bits | 2011-05-18 | Paper |
| SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS | 2010-11-11 | Paper |
| Trace monoids with idempotent generators and measure-only quantum automata | 2010-09-16 | Paper |
| Strong optimal lower bounds for Turing machines that accept nonregular languages | 2010-06-17 | Paper |
| On the Expressive Power of FO[ + ] | 2010-05-26 | Paper |
| More concise representation of regular languages by automata and regular expressions | 2010-04-08 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| More Concise Representation of Regular Languages by Automata and Regular Expressions | 2008-10-30 | Paper |
| TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE | 2008-09-25 | Paper |
| Quantum automata for some multiperiodic languages | 2007-12-19 | Paper |
| The complexity of minimum difference cover | 2007-11-05 | Paper |
| Complementing two-way finite automata | 2007-08-23 | Paper |
| Quantum finite automata with control language | 2007-04-10 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| Some formal tools for analyzing quantum automata. | 2006-05-18 | Paper |
| GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA | 2005-10-19 | Paper |
| Small size quantum automata recognizing some regular languages | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453217 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448361 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452048 | 2004-02-11 | Paper |
| Converting two-way nondeterministic unary automata into simpler automata. | 2003-08-17 | Paper |
| On the Size of One-way Quantum Finite Automata with Periodic Behaviors | 2003-07-09 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3150250 | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488955 | 2002-02-24 | Paper |
| Optimal Simulations between Unary Automata | 2001-06-21 | Paper |
| Threshold Circuits for Iterated Matrix Product and Powering | 2001-06-13 | Paper |
| The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503152 | 2000-09-04 | Paper |
| Sublogarithmic Bounds on Space and Reversals | 1998-09-21 | Paper |
| A remark on middle space bounded alternating Turing machines | 1997-02-27 | Paper |
| Corrigendum to ``An optimal lower bound for nonregular languages | 1996-03-18 | Paper |
| An optimal lower bound for nonregular languages | 1994-07-21 | Paper |
