| Publication | Date of Publication | Type |
|---|
Automatic semigroups vs automaton semigroups
(available as arXiv preprint) | 2022-07-21 | Paper |
Cyclic amalgams, HNN extensions, and Garside one-relator groups
Journal of Algebra | 2022-07-04 | Paper |
A new hierarchy for automaton semigroups
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Boundary dynamics for bireversible and for contracting automaton groups
International Journal of Algebra and Computation | 2020-03-25 | Paper |
Automaton (semi)groups: Wang tilings and Schreier tries
Trends in Mathematics | 2019-01-24 | Paper |
A new hierarchy for automaton semigroups
(available as arXiv preprint) | 2018-11-07 | Paper |
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
Automatic semigroups vs automaton semigroups
(available as arXiv preprint) | 2016-09-29 | Paper |
| Boundary action of automaton groups without singular points and Wang tilings | 2016-04-26 | Paper |
On torsion-free semigroups generated by invertible reversible Mealy automata
Language and Automata Theory and Applications | 2016-04-08 | Paper |
On torsion-free semigroups generated by invertible reversible Mealy automata
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Orbit automata as a new tool to attack the order problem in automaton groups
Journal of Algebra | 2015-11-17 | Paper |
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
Developments in Language Theory | 2015-11-10 | Paper |
A Characterization of Those Automata That Structurally Generate Finite Groups
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Cyclic amalgams, HNN extensions, and Garside one-relator groups
(available as arXiv preprint) | 2013-06-24 | Paper |
On the finiteness problem for automaton (semi)groups.
International Journal of Algebra and Computation | 2012-11-22 | Paper |
Implementing computations in automaton (semi)groups
Lecture Notes in Computer Science | 2012-09-20 | Paper |
A new Garside structure for the braid groups of type \((e,e,r)\).
Journal of the London Mathematical Society | 2011-12-08 | Paper |
Finite transducers for divisibility monoids
Theoretical Computer Science | 2006-10-20 | Paper |
Garside monoids vs divisibility monoids
Mathematical Structures in Computer Science | 2005-05-06 | Paper |
Automatic Structures for Torus Link Groups
Journal of Knot Theory and Its Ramifications | 2004-07-12 | Paper |
Explicit presentations for the dual braid monoids
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2003-07-02 | Paper |
The center of thin Gaussian groups
Journal of Algebra | 2002-10-16 | Paper |
THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
Communications in Algebra | 2002-06-16 | Paper |
