| Publication | Date of Publication | Type |
|---|
To infinity and beyond
(available as arXiv preprint) | 2021-07-28 | 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 |
Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
(available as arXiv preprint) | 2018-03-21 | Paper |
On level-transitivity and exponential growth
Semigroup Forum | 2018-02-28 | Paper |
On bireversible Mealy automata and the Burnside problem
Theoretical Computer Science | 2017-12-20 | Paper |
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
(available as arXiv preprint) | 2017-01-30 | Paper |
Automaton semigroups: the two-state case.
Theory of Computing Systems | 2016-06-03 | 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 |
On the supports of recognizable series over a field and a single letter alphabet
Information Processing Letters | 2013-04-04 | 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 |
| Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability. | 2012-04-23 | Paper |
| Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability. | 2012-04-23 | Paper |
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2040921 (Why is no real title available?) | 2004-02-11 | Paper |
A solution to the problem of (\(A\),\(B\))-invariance for series
Theoretical Computer Science | 2003-05-14 | Paper |
New types of automata to solve fixed point problems
Theoretical Computer Science | 2001-08-20 | Paper |
