On the existence of free subsemigroups in reversible automata semigroups

2018/11/12 by Dominik Francoeur, Ivan Mitrofanov, Francoeur, Dominik +1 · 1 citation
Mathematics · #20M35 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20M35

paper · pdf · doi:10.48550/arxiv.1811.04679

23 pages, 3 figures

arxiv created 2018/11/12 · arxiv updated 2018/11/13

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.

Cited by

• On bireversible automata and commensurators of groups in automorphisms of their Cayley graphs

Related

• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Semigroups Arising From Asynchronous Automata
• The growth rates of automaton groups generated by reset automata
• Infinite finitely generated automata semigroups have infinite orbits
• Automatic semigroups vs automaton semigroups