On groups whose word problem is solved by a nested stack automaton

Robert Gilman Michael Shapiro

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.