| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4994942 | 2021-06-22 | Paper |
| Non-Deterministic Finite Cover Automata | 2019-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376333 | 2018-09-17 | Paper |
| Distinguishability Operations and Closures | 2017-11-09 | Paper |
| Blum’s and Burgin’s Axioms, Complexity, and Randomness | 2017-03-31 | Paper |
| Nondeterministic Tree Width of Regular Languages | 2015-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178450 | 2015-03-16 | Paper |
| DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES | 2015-02-09 | Paper |
| Blum Static Complexity and Encoding Spaces | 2013-08-09 | Paper |
| Randomness Behaviour in Blum Universal Static Complexity Spaces | 2012-11-02 | Paper |
| A Note on Blum Static Complexity Measures | 2012-06-15 | Paper |
| Pattern expressions and pattern automata | 2009-08-27 | Paper |
| On the intersection of regex languages with regular languages | 2009-06-04 | Paper |
| On the closure of pattern expressions languages under intersection with regular languages | 2009-05-08 | Paper |
| Are binary codings universal? | 2008-12-21 | Paper |
| STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING | 2008-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517095 | 2008-08-12 | Paper |
| Incremental construction of minimal deterministic finite cover automata | 2007-01-09 | Paper |
| Automata recognizing no words: a statistical approach | 2006-11-21 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS | 2005-10-19 | Paper |
| COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313785 | 2005-09-01 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022285 | 2005-06-23 | Paper |
| SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES | 2005-06-22 | Paper |
| AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES | 2005-06-22 | Paper |
| Mergible states in large NFA | 2005-02-22 | 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/Q4807824 | 2004-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437813 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418600 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418599 | 2003-08-11 | Paper |
| Minimal cover-automata for finite languages | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955252 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4841277 | 1996-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866583 | 1996-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320662 | 1995-02-02 | Paper |
| Note on the topological structure of random strings | 1993-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729772 | 1989-01-01 | Paper |
