4 citations · 12 across the 7 of their papers we have counts for
3 papers · 1 filter
Eraser morphisms and membership problem in groups and monoids
Daniele D'Angeli, Emanuele Rodaro, Pedro V. Silva +1
We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We character…
Circular automata synchronize with high probability
Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez +2
In this paper we prove that a uniformly distributed random circular automaton of order synchronizes with high probability (whp). More precisely, we prove that $…
Infinite Automaton Semigroups and Groups Have Infinite Orbits
Daniele D'Angeli, Dominik Francoeur, Emanuele Rodaro +1
We show that an automaton group or semigroup is infinite if and only if it admits an -word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem com…