On groups whose word problem is solved by a nested stack automaton
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
