most citedOn groups whose word problem is solved by a nested stack automaton

14 citations · 14 across the 1 of their papers we have counts for

collaborators

1 paper

math.GR1998★ 14 cited

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.