On groups whose word problem is solved by a nested stack automaton
Group Theory
2007-05-23 v1
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.
Cite
@article{arxiv.math/9812028,
title = {On groups whose word problem is solved by a nested stack automaton},
author = {Robert Gilman Michael Shapiro},
journal= {arXiv preprint arXiv:math/9812028},
year = {2007}
}
Comments
16 pages