| Publication | Date of Publication | Type |
|---|
| New results on the generalized star-height problem | 2022-08-16 | Paper |
| Testing membership: Beyond permutation groups | 2022-08-16 | Paper |
| Finite loops recognize exactly the regular open languages | 2018-07-04 | Paper |
| Learning read-constant polynomials of constant degree modulo composites | 2015-02-05 | Paper |
| The Power of Diversity | 2011-07-29 | Paper |
| Learning Read-Constant Polynomials of Constant Degree Modulo Composites | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086935 | 2011-03-30 | Paper |
| Bounded-depth circuits | 2010-08-16 | Paper |
| WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY | 2010-05-25 | Paper |
| An Algebraic Perspective on Boolean Function Learning | 2009-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396575 | 2009-09-19 | Paper |
| An Algebraic Point of View on the Crane Beach Property | 2009-03-12 | Paper |
| Tractable Clones of Polynomials over Semigroups | 2008-09-09 | Paper |
| Logic Meets Algebra: the Case of Regular Languages | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Languages with Bounded Multiparty Communication Complexity | 2007-09-03 | Paper |
| Dichotomies in the complexity of solving systems of equations over finite semigroups | 2007-03-12 | Paper |
| Algebraic results on quantum automata | 2006-10-25 | Paper |
| A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits | 2006-10-16 | Paper |
| Learning expressions and programs over monoids | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| The many faces of a translation | 2006-01-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS | 2005-08-03 | Paper |
| Imre Simon: an exceptional graduate student | 2005-06-07 | Paper |
| First-order expressibility of languages with neutral letters or: The Crane Beach conjecture | 2005-05-12 | Paper |
| Complete classifications for the communication complexity of regular languages | 2005-04-19 | Paper |
| MONOIDS AND COMPUTATIONS | 2005-03-18 | Paper |
| Nesting until and since in linear temporal logic | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4814340 | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044318 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736862 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737911 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474840 | 2004-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449235 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407441 | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529537 | 2003-09-18 | Paper |
| Regular languages defined by generalized first-order formulas with a bounded number of bound variables | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418661 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418637 | 2003-08-11 | Paper |
| An algebraic approach to data languages and timed languages | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807833 | 2003-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791839 | 2003-02-03 | Paper |
| Efficient threshold circuits for power series | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779171 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536353 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542541 | 2002-09-17 | Paper |
| Temporal logic and semidirect products: An effective characterization of the until hierarchy | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762532 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762498 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762512 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754205 | 2001-11-11 | Paper |
| Programs over semigroups of dot-depth one | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942276 | 2000-03-21 | Paper |
| Circuits and expressions with nonassociative gates | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219022 | 1999-03-30 | Paper |
| Threshold circuits of small majority-depth | 1999-01-06 | Paper |
| Finite semigroup varieties defined by programs | 1998-07-22 | Paper |
| Nondeterministic \(NC^1\) computation | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3123635 | 1997-10-16 | Paper |
| Finite Monoids: From Word to Circuit Evaluation | 1997-08-03 | Paper |
| Logspace and logtime leaf languages | 1997-02-23 | Paper |
| Robert Knast (1940-1994) | 1996-03-20 | Paper |
| Regular languages defined with generalized quantifiers | 1995-07-10 | Paper |
| Circuits constructed with MOD\(_ q\) gates cannot compute ``and in sublinear size | 1995-04-06 | Paper |
| The membership problem in aperiodic transformation monoids | 1995-01-05 | Paper |
| THE BIDETERMINISTIC CONCATENATION PRODUCT | 1994-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281557 | 1994-03-10 | Paper |
| \(NC^ 1\): The automata-theoretic viewpoint | 1993-10-10 | Paper |
| Some results on the generalized star-height problem | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4029610 | 1993-03-28 | Paper |
| Regular languages in \(NC\) | 1992-09-27 | Paper |
| Two-sided wreath product of categories | 1992-06-27 | Paper |
| Non-uniform automata over groups | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732127 | 1989-01-01 | Paper |
| Programs over aperiodic monoids | 1989-01-01 | Paper |
| Finite monoids and the fine structure of NC 1 | 1988-01-01 | Paper |
| Locally trivial categories and unambiguous concatenation | 1988-01-01 | Paper |
| Partially ordered finite monoids and a theorem of I. Simon | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779765 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806849 | 1988-01-01 | Paper |
| On the equation \(x^ t=x^{t+q}\) in categories | 1988-01-01 | Paper |
| Catégories et langages de dot-depth un | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773353 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760747 | 1987-01-01 | Paper |
| Varieties of finite categories | 1986-01-01 | Paper |
| Graph congruences and wreath products | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689384 | 1984-01-01 | Paper |
| A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689383 | 1983-01-01 | Paper |
| Sur les monoides dont tous les groupes sont resolubles | 1983-01-01 | Paper |
| Classification of finite monoids: the language approach | 1981-01-01 | Paper |
| Recognizable languages and congruences | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3205447 | 1979-01-01 | Paper |
