On the existence of free subsemigroups in reversible automata semigroups
classification
🧮 math.GR
keywords
containsfreereversibleautomataautomatonelementexistencegenerated
read the original abstract
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.