G-automata, counter languages and the Chomsky hierarchy

Murray Elder

We consider how the languages of $G$-automata compare with other formal language classes. We prove that if the word problem of a group $G$ is accepted by a machine in the class $\m…