| Publication | Date of Publication | Type |
|---|
| Descriptional complexity of finite automata -- selected highlights | 2024-10-07 | Paper |
| Maximal existential and universal width | 2024-08-15 | Paper |
| Converting finite width AFAs to nondeterministic and universal finite automata | 2024-04-04 | Paper |
| Rediscovering pushdown machines | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070609 | 2023-11-23 | Paper |
| On the Simon's congruence neighborhood of languages | 2023-11-16 | Paper |
| On Simon's congruence closure of a string | 2023-09-07 | Paper |
| Existential and universal width of alternating finite automata | 2023-08-17 | Paper |
| Generalizations of Code Languages with Marginal Errors | 2023-08-15 | Paper |
| The nondeterministic state complexity of the site-directed deletion language operation | 2023-07-21 | Paper |
| On Simon's congruence closure of a string | 2023-01-18 | Paper |
| Decidability of confluence and termination of monadic term rewriting systems | 2022-12-09 | Paper |
| Deciding path size of nondeterministic (and input-driven) pushdown automata | 2022-11-17 | Paper |
| Width measures of alternating finite automata | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867523 | 2022-09-14 | Paper |
| Complexity of E0L structural equivalence | 2022-08-18 | Paper |
| Decidability of equivalence for deterministic synchronized tree automata | 2022-08-18 | Paper |
| Nondeterministic state complexity of site-directed deletion | 2022-08-16 | Paper |
| Concatenation operations and restricted variants of two-dimensional automata | 2022-03-24 | Paper |
| Degrees of restriction for two-dimensional automata | 2022-03-22 | Paper |
| Structural properties of NFAs and growth rates of nondeterminism measures | 2022-03-14 | Paper |
| Consensus string problem for multiple regular languages | 2021-07-21 | Paper |
| Recognition and complexity results for projection languages of two-dimensional automata | 2021-07-14 | Paper |
| Combining limited parallelism and nondeterminism in alternating finite automata | 2021-07-14 | Paper |
| Decision problems and projection languages for restricted variants of two-dimensional automata | 2021-06-03 | Paper |
| Closest substring problems for regular languages | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964021 | 2021-02-24 | Paper |
| Finite-state complexity and the size of transducers | 2021-02-24 | Paper |
| Nondeterministic state complexity for suffix-free regular languages | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964022 | 2021-02-24 | Paper |
| Transition complexity of incomplete DFAs | 2021-02-24 | Paper |
| Alternating finite automata with limited universal branching | 2020-07-27 | Paper |
| Site-directed insertion: decision problems, maximality and minimality | 2020-06-30 | Paper |
| Cycle height of finite automata | 2020-06-30 | Paper |
| Further closure properties of input-driven pushdown automata | 2020-06-30 | Paper |
| Nondeterminism growth and state complexity | 2020-05-12 | Paper |
| Limited nondeterminism of input-driven pushdown automata: decidability and complexity | 2020-05-12 | Paper |
| Decision problems for restricted variants of two-dimensional automata | 2020-05-06 | Paper |
| Branching measures and nearly acyclic NFAs | 2019-12-10 | Paper |
| State complexity of suffix distance | 2019-12-10 | Paper |
| State complexity of the quotient operation on input-driven pushdown automata | 2019-12-10 | Paper |
| Site-directed insertion: language equations and decision problems | 2019-11-07 | Paper |
| Further closure properties of input-driven pushdown automata | 2019-11-07 | Paper |
| The relative edit-distance between two input-driven languages | 2019-10-15 | Paper |
| Pseudo-inversion: closure properties and decidability | 2019-07-08 | Paper |
| Edit distance neighbourhoods of input-driven pushdown automata | 2019-06-18 | Paper |
| Inclusion is undecidable for pattern languages | 2019-03-29 | Paper |
| Closest substring problems for regular languages | 2018-11-22 | Paper |
| Site-directed deletion | 2018-11-22 | Paper |
| Descriptional complexity of error detection | 2018-10-04 | Paper |
| Quasi-distances and weighted finite automata | 2018-09-20 | Paper |
| Growth rate of minimum branching | 2018-09-17 | Paper |
| State complexity of neighbourhoods and approximate pattern matching | 2018-05-15 | Paper |
| State complexity of prefix distance of subregular languages | 2018-03-29 | Paper |
| Routing in a polygonal terrain with the shortest beacon watchtower | 2018-02-19 | Paper |
| State complexity of \(k\)-parallel tree concatenation | 2018-01-19 | Paper |
| Outfix-guided insertion | 2017-12-06 | Paper |
| Relative prefix distance between languages | 2017-10-13 | Paper |
| Pseudoknot-generating operation | 2017-09-28 | Paper |
| Branching measures and nearly acyclic NFAs | 2017-08-31 | Paper |
| State complexity of suffix distance | 2017-08-31 | Paper |
| The quotient operation on input-driven pushdown automata | 2017-08-31 | Paper |
| Ambiguity, nondeterminism and state complexity of finite automata | 2017-08-25 | Paper |
| Edit distance neighbourhoods of input-driven pushdown automata | 2017-08-22 | Paper |
| Worst Case Branching and Other Measures of Nondeterminism | 2017-06-20 | Paper |
| State complexity of prefix distance | 2017-06-19 | Paper |
| State complexity of permutation on finite languages over a binary alphabet | 2017-06-15 | Paper |
| Consensus string problem for multiple regular languages | 2017-06-01 | Paper |
| State complexity of operations on input-driven pushdown automata | 2017-05-26 | Paper |
| State complexity of insertion | 2017-03-28 | Paper |
| Lower bound for converting an NFA with finite nondeterminism into an MDFA | 2016-12-16 | Paper |
| State complexity of prefix distance of subregular languages | 2016-11-09 | Paper |
| Outfix-guided insertion (extended abstract) | 2016-08-30 | Paper |
| Tree homomorphisms for unranked trees | 2016-07-26 | Paper |
| State complexity of Kleene-star operations on regular tree languages | 2016-05-03 | Paper |
| Approximate matching between a context-free grammar and a finite-state automaton | 2016-03-10 | Paper |
| Pseudoknot-generating operation | 2016-03-10 | Paper |
| Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes | 2016-03-09 | Paper |
| State complexity of deletion and bipolar deletion | 2016-02-19 | Paper |
| State complexity of inversion operations | 2015-12-10 | Paper |
| Operational state complexity of unary NFAs with finite nondeterminism | 2015-12-10 | Paper |
| State complexity of neighbourhoods and approximate pattern matching | 2015-11-10 | Paper |
| Generalizations of code languages with marginal errors | 2015-11-10 | Paper |
| State complexity of prefix distance | 2015-09-23 | Paper |
| Pseudo-inversion on formal languages | 2015-09-14 | Paper |
| Duplications and pseudo-duplications | 2015-09-14 | Paper |
| Nondeterministic tree width of regular languages | 2015-08-07 | Paper |
| Quasi-distances and weighted finite automata | 2015-08-07 | Paper |
| The state complexity of permutations on finite languages over binary alphabets | 2015-08-07 | Paper |
| State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages | 2015-07-06 | Paper |
| State complexity of finite tree width NFAs | 2015-03-16 | Paper |
| Nondeterministic state complexity of proportional removals | 2015-02-09 | Paper |
| Unary NFAs with limited nondeterminism | 2015-01-13 | Paper |
| Descriptional complexity of unambiguous input-driven pushdown automata | 2015-01-06 | Paper |
| Input-Driven Pushdown Automata with Limited Nondeterminism | 2014-10-14 | Paper |
| State Complexity of Deletion | 2014-10-14 | Paper |
| State complexity of unary language operations for NFAs with limited nondeterminism | 2014-08-07 | Paper |
| State complexity of inversion operations | 2014-08-07 | Paper |
| Computation width and deviation number | 2014-08-07 | Paper |
| The edit-distance between a regular language and a context-free language | 2014-08-04 | Paper |
| Goodby to the kindhearted dragon Prof. Sheng Yu, 1950--2012 | 2014-08-04 | Paper |
| Top-down tree edit-distance of regular tree languages | 2014-03-31 | Paper |
| Undecidability of state complexity | 2013-10-22 | Paper |
| State complexity of \(k\)-union and \(k\)-intersection for prefix-free regular languages | 2013-08-09 | Paper |
| Comparisons between measures of nondeterminism on finite automata | 2013-08-09 | Paper |
| Nondeterministic state complexity of proportional removals | 2013-08-09 | Paper |
| Finite nondeterminism versus DFAs with multiple initial states | 2013-08-09 | Paper |
| Approximate matching between a context-free grammar and a finite-state automaton | 2013-08-07 | Paper |
| Cellular automaton based motion planning algorithms for mobile sensor networks | 2012-11-21 | Paper |
| State complexity and limited nondeterminism | 2012-11-02 | Paper |
| State complexity of projection and quotient on unranked trees | 2012-11-02 | Paper |
| Computing the edit-distance between a regular language and a context-free language | 2012-11-02 | Paper |
| Descriptional complexity of input-driven pushdown automata | 2012-11-01 | Paper |
| Sheng Yu (1950–2012) In Memoriam | 2012-10-31 | Paper |
| Lower bounds for the size of deterministic unranked tree automata | 2012-10-11 | Paper |
| In memoriam Sheng Yu | 2012-09-20 | Paper |
| State-size hierarchy for finite-state complexity | 2012-08-30 | Paper |
| State complexity of Kleene-star operations on trees | 2012-06-15 | Paper |
| State complexity of the concatenation of regular tree languages | 2012-05-30 | Paper |
| Transformations between different models of unranked bottom-up tree automata | 2011-11-22 | Paper |
| Transition complexity of incomplete DFAs | 2011-11-22 | Paper |
| Finite state complexity | 2011-10-10 | Paper |
| Overlap-free languages and solid codes | 2011-10-10 | Paper |
| State complexity of operations on input-driven pushdown automata | 2011-08-17 | Paper |
| State trade-offs in unranked tree automata | 2011-07-29 | Paper |
| Limitations of lower bound methods for deterministic nested word automata | 2011-07-27 | Paper |
| Extended Watson-Crick L Systems with Regular Trigger Languages | 2011-06-17 | Paper |
| Undecidability of the state complexity of composed regular operations | 2011-06-03 | Paper |
| Descriptional complexity of unambiguous nested word automata | 2011-06-03 | Paper |
| On language decompositions and primality | 2011-05-27 | Paper |
| Analysis of a cellular automaton model for car traffic with a slow-to-stop rule | 2010-10-07 | Paper |
| Orthogonal concatenation: language equations and state complexity | 2010-09-22 | Paper |
| State complexity of additive weighted finite automata | 2010-01-29 | Paper |
| Operational state complexity of prefix-free regular languages | 2010-01-07 | Paper |
| An improved cellular automata based algorithm for the 45-convex hull problem | 2010-01-04 | Paper |
| Variants of codes and indecomposable languages | 2009-11-27 | Paper |
| Deciding determinism of caterpillar expressions | 2009-09-14 | Paper |
| Operational state complexity of nested word automata | 2009-08-07 | Paper |
| Nondeterministic state complexity of nested word automata | 2009-08-07 | Paper |
| On the descriptional complexity of Watson-Crick automata | 2009-08-07 | Paper |
| On the synchronized derivation depth of context-free grammars | 2009-08-07 | Paper |
| State complexity of basic operations on suffix-free regular languages | 2009-07-10 | Paper |
| A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule | 2009-07-09 | Paper |
| Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages | 2009-05-22 | Paper |
| State Complexity of Nested Word Automata | 2009-04-02 | Paper |
| State Complexity of Combined Operations for Prefix-Free Regular Languages | 2009-04-02 | Paper |
| A Cryptosystem Based on the Composition of Reversible Cellular Automata | 2009-04-02 | Paper |
| Prime Decompositions of Regular Languages | 2009-03-26 | Paper |
| Language Decompositions, Primality, and Trajectory-Based Operations | 2009-02-12 | Paper |
| STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES | 2008-11-24 | Paper |
| Length Codes, Products of Languages and Primality | 2008-11-20 | Paper |
| Lower bounds for the transition complexity of NFAs | 2008-11-19 | Paper |
| State Complexity of Basic Operations on Suffix-Free Regular Languages | 2008-09-17 | Paper |
| The state complexity of two combined operations: star of catenation and star of reversal | 2008-06-11 | Paper |
| Deterministic Caterpillar Expressions | 2008-06-10 | Paper |
| ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION | 2008-05-20 | Paper |
| Transition complexity of language operations | 2007-12-19 | Paper |
| On the existence of regular approximations | 2007-12-19 | Paper |
| An infinite hierarchy induced by depth synchronization | 2007-12-19 | Paper |
| Descriptional Complexity of Nondeterministic Finite Automata | 2007-11-28 | Paper |
| State Complexity of Union and Intersection of Finite Languages | 2007-11-28 | Paper |
| Additive distances and quasi-distances between words | 2007-10-17 | Paper |
| State complexity of combined operations | 2007-09-19 | Paper |
| Iterated TGR Languages: Membership Problem and Effective Closure Properties | 2007-09-10 | Paper |
| Lower Bounds for the Transition Complexity of NFAs | 2007-09-05 | Paper |
| On the existence of prime decompositions | 2007-05-11 | Paper |
| Intercode regular languages | 2007-04-02 | Paper |
| Codes defined by multiple sets of trajectories | 2007-01-09 | Paper |
| Interpreted trajectories | 2006-11-21 | Paper |
| Nondeterminism degrees for context-free languages | 2006-09-06 | Paper |
| Decidability of trajectory-based equations | 2005-12-06 | Paper |
| RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS | 2005-11-14 | Paper |
| A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313787 | 2005-09-01 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681310 | 2005-06-23 | Paper |
| SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662838 | 2005-03-30 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737906 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474150 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474149 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807824 | 2004-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453466 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431342 | 2003-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418600 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799361 | 2003-04-23 | Paper |
| A sharpening of the Parikh mapping | 2002-09-18 | Paper |
| Decidability of EDT0L structural equivalence | 2002-07-15 | Paper |
| Loop-free alternating finite automata | 2002-02-13 | Paper |
| Generalized fairness and context-free languages | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955255 | 2001-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520792 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520282 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531373 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941147 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500369 | 2000-09-04 | Paper |
| Efficient implementation of regular languages using reversed alternating finite automata | 2000-08-23 | Paper |
| Alternating finite automata and star-free languages | 2000-08-21 | Paper |
| Pattern languages with and without erasing | 2000-07-04 | Paper |
| Transducers and the decidability of independence in free monoids | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264099 | 1999-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266531 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217608 | 1999-06-21 | Paper |
| Synchronization expressions with extended join operation | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390537 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362739 | 1997-11-13 | Paper |
| Pumping and pushdown machines | 1997-10-30 | Paper |
| Complexity of E0L structural equivalence | 1997-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336269 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125168 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341028 | 1997-06-16 | Paper |
| Structural equivalence and ET0L grammars | 1997-02-27 | Paper |
| Decidability of equivalence for deterministic synchronized tree automata | 1997-02-27 | Paper |
| Yield-languages of two-way pushdown tree automata | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942249 | 1996-01-01 | Paper |
| P, NP, and the Post correspondence problem | 1995-11-14 | Paper |
| Measures of nondeterminism for pushdown automata | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840170 | 1995-07-20 | Paper |
| Decision problems for patterns | 1995-06-08 | Paper |
| Synchronized tree automata | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284264 | 1994-04-17 | Paper |
| The state complexities of some basic operations on regular languages | 1994-04-05 | Paper |
| Semantics of trees | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033499 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036177 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974879 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4713373 | 1992-06-25 | Paper |
| Decidability of structural equivalence of E0L grammars | 1991-01-01 | Paper |
| The immortality problem for Lag systems | 1990-01-01 | Paper |
| Hierarchy ofk-context-free languages | 1989-01-01 | Paper |
| Hierarchy of k-context-free languages part 1 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734779 | 1989-01-01 | Paper |
| Deterministic tree pushdown automata and monadic tree rewriting systems | 1988-01-01 | Paper |
| Yield-languages recognized by alternating tree recognizers | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813317 | 1988-01-01 | Paper |
| A pumping result for 2-context-free languages | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735094 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758109 | 1986-01-01 | Paper |
| Direction independent context-sensitive grammars | 1984-01-01 | Paper |
