On groups whose word problem is solved by a nested stack automaton
Robert Gilman Michael Shapiro
math.GRarXiv: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.
Create a lesson
Related papers
Kleisli convolution representations of power monoids
Haicun Wen, Jian He, Yu-Zhe Liu
The Hurwitz Action in the Affine Symmetric Group
Patrick Wegener
Classification of Group Extensions
Claude Archer
A Determination of B-groups of Order p4
Christopher Herbig
A note on normal generation and the first 2-betti number
Sam P. Fisher, Yash Lodha
Asymptotic enumeration of minimally transitive permutation groups
Binzhou Xia, Shasha Zheng