Year: 2018
Type: preprint
Abstract: We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,τ)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.
Source: arXiv (Cornell University)
Author: Francoeur, Dominik
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2785906865