| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4994941 | 2021-06-22 | Paper |
| State Complexity of Overlap Assembly | 2021-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964007 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146512 | 2021-01-26 | Paper |
| Most complex deterministic union-free regular languages | 2020-06-30 | Paper |
| State complexity of single-word pattern matching in regular languages | 2020-05-12 | Paper |
| Most Complex Non-Returning Regular Languages | 2019-12-10 | Paper |
| Complexity of proper prefix-convex regular languages | 2019-08-20 | Paper |
| State complexity of pattern matching in regular languages | 2019-06-18 | Paper |
| State complexity of overlap assembly | 2018-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376331 | 2018-09-17 | Paper |
| On the delay-sensitivity of gate networks | 2018-09-14 | Paper |
| Syntactic complexity of regular ideals | 2018-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4609327 | 2018-03-29 | Paper |
| Syntactic complexity of suffix-free languages | 2018-03-21 | Paper |
| Quotient complexity of closed languages | 2017-11-07 | Paper |
| Complexity of suffix-free regular languages | 2017-09-07 | Paper |
| Most complex non-returning regular languages | 2017-08-31 | Paper |
| Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages | 2017-08-25 | Paper |
| Complexity of proper prefix-convex regular languages | 2017-08-22 | Paper |
| Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages | 2017-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965987 | 2017-03-03 | Paper |
| Unrestricted State Complexity of Binary Operations on Regular Languages | 2016-11-09 | Paper |
| On the State Complexity of the Shuffle of Regular Languages | 2016-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819381 | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740417 | 2016-07-26 | Paper |
| Quotient Complexities of Atoms in Regular Ideal Languages | 2016-05-03 | Paper |
| Large Aperiodic Semigroups | 2016-02-17 | Paper |
| Complexity of Suffix-Free Regular Languages | 2015-09-29 | Paper |
| Upper Bound on Syntactic Complexity of Suffix-Free Languages | 2015-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178449 | 2015-03-16 | Paper |
| SYNTACTIC COMPLEXITY OF â- AND đ„-TRIVIAL REGULAR LANGUAGES | 2015-02-09 | Paper |
| Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals | 2014-10-14 | Paper |
| Large Aperiodic Semigroups | 2014-09-26 | Paper |
| Most Complex Regular Right-Ideal Languages | 2014-08-07 | Paper |
| COMPLEXITY OF ATOMS OF REGULAR LANGUAGES | 2014-08-04 | Paper |
| Symmetric Groups and Quotient Complexity of Boolean Operations | 2014-07-01 | Paper |
| Theory of ĂĄtomata | 2014-06-06 | Paper |
| IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES | 2014-03-10 | Paper |
| Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star | 2013-08-09 | Paper |
| Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages | 2013-08-09 | Paper |
| Universal Witnesses for State Complexity of Basic Operations Combined with Reversal | 2013-08-07 | Paper |
| QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES | 2013-06-06 | Paper |
| Quotient complexity of ideal languages | 2013-02-19 | Paper |
| Quotient Complexities of Atoms of Regular Languages | 2012-11-02 | Paper |
| Syntactic Complexities of Some Classes of Star-Free Languages | 2012-11-02 | Paper |
| In Search of Most Complex Regular Languages | 2012-09-20 | Paper |
| ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS | 2012-08-30 | Paper |
| Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages | 2012-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389283 | 2012-04-26 | Paper |
| Theory of Ătomata | 2011-07-29 | Paper |
| Syntactic Complexity of Ideal and Closed Languages | 2011-07-29 | Paper |
| Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages | 2011-07-29 | Paper |
| Decision problems for convex languages | 2011-07-27 | Paper |
| CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM | 2011-03-30 | Paper |
| REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES | 2011-01-06 | Paper |
| Quotient complexity of closed languages | 2010-06-22 | Paper |
| Complexity in Convex Languages | 2010-05-26 | Paper |
| Quotient Complexity of Ideal Languages | 2010-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5306170 | 2010-04-08 | Paper |
| State-complexity hierarchies of uniform languages of alphabet-size length | 2009-08-07 | Paper |
| Predictable semiautomata | 2009-08-07 | Paper |
| Closures in Formal Languages and Kuratowskiâs Theorem | 2009-07-07 | Paper |
| Decision Problems for Convex Languages | 2009-04-02 | Paper |
| COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS | 2006-08-21 | Paper |
| Representation of a class of nondeterministic semiautomata by canonical words. | 2006-05-18 | Paper |
| REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES | 2005-11-14 | Paper |
| SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS | 2005-10-19 | Paper |
| INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS | 2005-09-27 | Paper |
| Gate circuits in the algebra of transients | 2005-06-07 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Hazard algebras | 2004-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450438 | 2004-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418598 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418604 | 2003-08-11 | Paper |
| True concurrency in models of asynchronous circuit behavior | 2003-05-11 | Paper |
| A CHARACTERIZATION OF de MORGAN ALGEBRAS | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776605 | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770665 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941143 | 2000-09-26 | Paper |
| Automata of asynchronous behaviors | 2000-08-23 | Paper |
| Delay-insensitivity and ternary simulation | 2000-08-21 | Paper |
| Generalized ternary simulation of sequential circuits | 1997-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348002 | 1997-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4884884 | 1996-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971259 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971274 | 1992-06-25 | Paper |
| Consistency and satisfiability of waveform timing specifications | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352965 | 1989-01-01 | Paper |
| A unified framework for race analysis of asynchronous networks | 1989-01-01 | Paper |
| An optimistic ternary simulation of gate races | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780897 | 1987-01-01 | Paper |
| A Characterization of Ternary Simulation of Gate Networks | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3726020 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727872 | 1986-01-01 | Paper |
| Graph congruences and pair testing | 1986-01-01 | Paper |
| On serializability | 1985-01-01 | Paper |
| On generalized locally testable languages | 1984-01-01 | Paper |
| On equations for regular languages, finite automata, and sequential networks | 1980-01-01 | Paper |
| Languages of R-trivial monoids | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886889 | 1980-01-01 | Paper |
| On a Ternary Model of Gate Networks | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199560 | 1979-01-01 | Paper |
| The dot-depth hierarchy of star-free languages is infinite | 1978-01-01 | Paper |
| A generalization of finiteness | 1977-01-01 | Paper |
| Run languages | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141110 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066995 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4098669 | 1975-01-01 | Paper |
| Characterizations of locally testable events | 1973-01-01 | Paper |
| On Translation Algorithms in Residue Number Systems | 1972-01-01 | Paper |
| About Feedback and SR Flip-Flops | 1971-01-01 | Paper |
| Dot-depth of star-free events | 1971-01-01 | Paper |
| Classification of noncounting events | 1971-01-01 | Paper |
| General properties of star height of regular events | 1970-01-01 | Paper |
| Sign Detection in Residue Number Systems | 1969-01-01 | Paper |
| On Decompositions of Regular Events | 1969-01-01 | Paper |
| Definite Asynchronous Sequential Circuits | 1968-01-01 | Paper |
| On single-loop realizations of sequential machines | 1967-01-01 | Paper |
| Roots of Star Events | 1967-01-01 | Paper |
| A Diagrammatic Approach to Multilevel Logic Synthesis | 1965-01-01 | Paper |
| Derivatives of Regular Expressions | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5725992 | 1963-01-01 | Paper |
| Boolean Matrices and the Stability of Neural Nets | 1963-01-01 | Paper |
| A Survey of Regular Expressions and Their Applications | 1962-01-01 | Paper |
