| Publication | Date of Publication | Type |
|---|
Testing membership: Beyond permutation groups
STACS 89 | 2022-08-16 | Paper |
Finite loops recognize exactly the regular open languages
Automata, Languages and Programming | 2018-07-04 | Paper |
Languages recognized by finite aperiodic groupoids
STACS 96 | 2017-11-16 | Paper |
Conservative groupoids recognize only regular languages
Information and Computation | 2014-11-28 | Paper |
Commutative subloop-free loops.
Commentationes Mathematicae Universitatis Carolinae | 2012-07-10 | Paper |
Commutative subloop-free loops.
Commentationes Mathematicae Universitatis Carolinae | 2012-07-10 | Paper |
On the size of inverse semigroups given by generators
Theoretical Computer Science | 2011-02-21 | Paper |
| Unbreakable Loops | 2010-09-02 | Paper |
Faithful Loops for Aperiodic E-Ordered Monoids
Automata, Languages and Programming | 2009-07-14 | Paper |
The complexity of tensor circuit evaluation
Computational Complexity | 2008-02-22 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Algebraic results on quantum automata
Theory of Computing Systems | 2006-10-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2087237 (Why is no real title available?) | 2004-08-11 | Paper |
McNaughton families of languages.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1834647 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1688356 (Why is no real title available?) | 2002-01-09 | Paper |
Languages recognized by finite aperiodic groupoids
Theoretical Computer Science | 1999-01-12 | Paper |
Finite Monoids: From Word to Circuit Evaluation
SIAM Journal on Computing | 1997-08-03 | Paper |
Circuits, matrices, and nonassociative computation
Journal of Computer and System Sciences | 1996-04-29 | Paper |
The membership problem in aperiodic transformation monoids
Journal of the ACM | 1995-01-05 | Paper |
| scientific article; zbMATH DE number 512861 (Why is no real title available?) | 1994-04-07 | Paper |
Characterization of idempotent transformation monoids
Information Processing Letters | 1989-01-01 | Paper |
Membership testing in commutative transformation semigroups
Information and Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4068272 (Why is no real title available?) | 1987-01-01 | Paper |
