  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.
