Semigroups arising from asynchronous automata.

From MaRDI portal
Publication:2016100

DOI10.4171/GGD/222zbMATH Open1326.20063arXiv1011.2457OpenAlexW2964278487MaRDI QIDQ2016100FDOQ2016100

David McCune

Publication date: 19 June 2014

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Abstract: We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in the class of expanding automaton semigroups, and that the class of expanding automaton semigroups is strictly contained in the class of asynchronous automaton semigroups. We investigate the dynamics of expanding automaton semigroups acting on regular rooted trees, and show that undecidability arises in these actions. We show that this class is not closed under taking normal ideal extensions, but the class of asynchronous automaton semigroups is closed under taking these extensions. We construct every free partially commutative monoid as a synchronous automaton semigroup.


Full work available at URL: https://arxiv.org/abs/1011.2457





Cites Work


Cited In (5)






This page was built for publication: Semigroups arising from asynchronous automata.

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