On the existence of free subsemigroups in reversible automata semigroups
Group Theory
2018-11-13 v1
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.
Cite
@article{arxiv.1811.04679,
title = {On the existence of free subsemigroups in reversible automata semigroups},
author = {Dominik Francoeur and Ivan Mitrofanov},
journal= {arXiv preprint arXiv:1811.04679},
year = {2018}
}
Comments
23 pages, 3 figures