Semigroups Arising From Asynchronous Automata

Details Semigroups Arising From Asynchronous Automata Semigroups Arising From Asynchronous Automata

2010-11-10

arxiv.org/abs/1011.2457v1

Mathematics

Group Theory

31 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Semigroups Arising From Asynchronous Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semigroups Arising From Asynchronous Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semigroups Arising From Asynchronous Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-614261