| Publication | Date of Publication | Type |
|---|
| Rediscovering pushdown machines | 2024-01-29 | Paper |
| Characterizing regular languages with polynomial densities | 2022-08-18 | Paper |
| Complexity of EOL structural equivalence | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964010 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964014 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146522 | 2021-01-26 | Paper |
| Inclusion is undecidable for pattern languages | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4590910 | 2017-11-20 | Paper |
| Computing Supply Function Equilibria via Spline Approximations | 2015-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5418260 | 2014-06-03 | Paper |
| Online scheduling of simple linear deteriorating jobs to minimize the total general completion time | 2013-12-11 | Paper |
| An Optimal Single-Machine Scheduling with Linear Deterioration Rate and Rate-Modifying Activities | 2013-12-10 | Paper |
| Undecidability of state complexity | 2013-10-22 | Paper |
| STATE COMPLEXITY AND APPROXIMATION | 2013-01-18 | Paper |
| State complexity of union and intersection of square and reversal on \(k\) regular languages | 2012-10-11 | Paper |
| STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL | 2012-08-30 | Paper |
| State complexity of combined operations with two basic operations | 2012-08-08 | Paper |
| Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines | 2012-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893301 | 2012-06-20 | Paper |
| Derivatives of Regular Expressions and an Application | 2012-06-15 | Paper |
| State complexity of union and intersection of star on \(k\) regular languages | 2012-05-30 | Paper |
| STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION | 2012-03-13 | Paper |
| A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time | 2012-03-09 | Paper |
| Transition Complexity of Incomplete DFAs | 2011-11-22 | Paper |
| Introducing the Adaptive Convex Enveloping | 2011-11-10 | Paper |
| Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints | 2011-08-12 | Paper |
| State Complexity Research and Approximation | 2011-07-29 | Paper |
| Derick Wood: Always in Our Hearts | 2011-07-29 | Paper |
| State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal | 2011-07-29 | Paper |
| Undecidability of the State Complexity of Composed Regular Operations | 2011-06-03 | Paper |
| State Complexity of Catenation Combined with Union and Intersection | 2011-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4929400 | 2010-09-22 | Paper |
| SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES | 2010-03-09 | Paper |
| SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES | 2010-01-29 | Paper |
| On implementing recognizable transductions | 2010-01-26 | Paper |
| Variants of codes and indecomposable languages | 2009-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396615 | 2009-09-19 | Paper |
| Deciding determinism of caterpillar expressions | 2009-09-14 | Paper |
| Pattern expressions and pattern automata | 2009-08-27 | Paper |
| Hierarchy and equivalence of multi-letter quantum finite automata | 2009-08-07 | Paper |
| Estimation of state complexity of combined operations | 2009-08-07 | Paper |
| Are Statecharts Finite Automata? | 2009-07-09 | Paper |
| State Complexity of Combined Operations for Prefix-Free Regular Languages | 2009-04-02 | Paper |
| On Weakly Ambiguous Finite Transducers | 2009-03-26 | Paper |
| Length Codes, Products of Languages and Primality | 2008-11-20 | Paper |
| State complexity of basic language operations combined with reversal | 2008-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517095 | 2008-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505886 | 2008-06-11 | Paper |
| Deterministic Caterpillar Expressions | 2008-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422230 | 2007-10-17 | Paper |
| State complexity of combined operations | 2007-09-19 | Paper |
| On the State Complexity of Combined Operations | 2007-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294171 | 2007-07-24 | Paper |
| On the existence of prime decompositions | 2007-05-11 | Paper |
| Subword conditions and subword histories | 2007-01-22 | Paper |
| Representation and uniformization of algebraic transductions | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409996 | 2006-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485994 | 2006-09-06 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS | 2005-10-19 | Paper |
| WORD COMPLEXITY AND REPETITIONS IN WORDS | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681320 | 2005-06-23 | Paper |
| AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4671950 | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665748 | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662823 | 2005-03-30 | Paper |
| Mergible states in large NFA | 2005-02-22 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Subword histories and Parikh matrices | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808652 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737707 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737919 | 2004-08-11 | Paper |
| On the state complexity of reversals of regular languages | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474149 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474150 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807824 | 2004-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4458492 | 2004-03-18 | Paper |
| Follow automata. | 2004-03-14 | Paper |
| Reducing NFAs by invariant equivalences. | 2004-03-14 | 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/Q4430296 | 2003-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418600 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418648 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708581 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782104 | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152811 | 2002-10-23 | Paper |
| A sharpening of the Parikh mapping | 2002-09-18 | Paper |
| Tree-systems of morphisms | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540971 | 2002-07-28 | Paper |
| Decidability of EDT0L structural equivalence | 2002-07-15 | Paper |
| On the robustness of primitive words | 2002-05-15 | Paper |
| Minimal cover-automata for finite languages | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770691 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2731279 | 2002-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714235 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955255 | 2001-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708948 | 2001-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520792 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531373 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263694 | 2000-10-17 | 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 |
| Using DNA to solve the bounded Post correspondence problem | 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/Q4955252 | 2000-05-25 | 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 |
| DNA computing, sticker systems, and universality | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390537 | 1998-08-10 | Paper |
| Physical versus computational complementarity. I | 1998-06-02 | Paper |
| Language-theoretic complexity of disjunctive sequences | 1998-03-25 | 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 |
| Structural equivalence and ET0L grammars | 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 |
| On sparse languages \(L\) such that \(LL= \Sigma^*\) | 1994-09-27 | 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 |
| Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems | 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 |
| Computation theoretic aspects of cellular automata | 1990-01-01 | Paper |
| Formal languages and global cellular automaton behavior | 1990-01-01 | Paper |
| The immortality problem for Lag systems | 1990-01-01 | Paper |
| A pumping lemma for deterministic context-free languages | 1989-01-01 | Paper |
| On the Limit Sets of Cellular Automata | 1989-01-01 | Paper |
| Can the catenation of two weakly sparse languages be dense? | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805907 | 1988-01-01 | Paper |
| Decision problems resulting from grammatical inference | 1987-01-01 | Paper |
| Fault-tolerant schemes for some systolic systems | 1987-01-01 | Paper |
| A property of real-time trellis automata | 1986-01-01 | Paper |
| Real-time, pseudo real-time, and linear-time ITA | 1986-01-01 | Paper |
| On a public-key cryptosystem based on iterated morphisms and substitutions | 1986-01-01 | Paper |
| Iterative tree arrays with logarithmic depth† | 1986-01-01 | Paper |
| Iterative tree automata | 1984-01-01 | Paper |
