On groups whose word problem is solved by a nested stack automaton
arXiv:math/9812028
Abstract
Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
16 pages