Multipass automata and group word problems

We introduce the notion of multipass automata as a generalization of push-down automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the class of deterministic context-free languages while the class of languages accepted by nondeterministic… CONTINUE READING