Automatic semigroup acts. (Q2344292): Difference between revisions

In this paper are introduced automatic semigroup acts (\(S\)-acts), which are a generalization of the semigroup and group theoretic notion, if the set on which \(S\) acts is \(S\) itself. It is proved, that automaticity is invariant under changing the generators of the \(S\)-act and also invariant under changing the generators of \(S\), if \(S^n=S^{n+1}\) for some \(n\in\mathbb N\). The equality problem for automatic \(S\)-acts is solvable in quadratic time and the fellow traveller property holds in the graph associated with the \(S\)-act.