Abstract
In this paper we study semigroups of transformations of free monoids (and transformations of the corresponding tree boundaries) that arise from asynchronous automata. We introduce a subclass of asynchronous automata that we call “expanding automata”. We show that every free partially commutative monoid is a synchronous automaton semigroup, and every free partially commutative semigroup is an expanding automaton semigroup. We show that undecidability arises in the actions of these semigroups on trees. In particular, in the class of asynchronous automata there is no algorithm which detects the presence of coincidence points and there is no algorithm which detects the presence of fixed points. We show that the classes of semigroups that arise from synchronous, expanding, and asynchronous automata are distinct classes of semigroups. We end the paper by covering some basic algebraic theory of these semigroups, with an emphasis on subgroups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
