Infinite finitely generated automata semigroups have infinite orbits
Abstract
We prove that the semigroup generated by a finite state Mealy automaton A=(Q,A,τ) is infinite if and only if there exists some right-infinite word in the alphabet A with infinite orbit.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.