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

		  Robert Gilman and Michael Shapiro

Accessible groups whose word problems are accepted by a deterministic 
nested stack automaton with limited erasing are virtually free.