Infinite finitely generated automata semigroups have infinite orbits

MaRDI QIDQ6297114zbMATH OpenFDO

Authors Dominik Francoeur

Publication date 30 January 2018

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We prove that the semigroup generated by a finite state Mealy automaton $mathcalA=(Q,A,au)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.

This page was built for publication: Infinite finitely generated automata semigroups have infinite orbits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6297114)