On groups whose word problem is solved by a nested stack automaton

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.

arXiv comment16 pages

References in corpus (1)

• Formal Languages and Infinite Groups

Cited by in corpus (6)

• Cayley automatic representations of wreath products
• G-automata, counter languages and the Chomsky hierarchy
• Formal languages and groups as memory
• Pattern avoiding permutations are context-sensitive
• On the rational subset problem for groups
• On the Degree of Extension of Some Models Defining Non-Regular Languages