论字问题由嵌套栈自动机求解的群
群论
2007-05-23 v1
摘要
对于可访问群,若定义单位元的所有词汇的语言被某类嵌套栈自动机接受,则该群是 virtually free 的。
引用
@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}
}
备注
16 pages