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

1998/12/04 by Robert Gilman Michael Shapiro, Shapiro, Robert Gilman Michael
Mathematics · #20F32 (primary) #68Q68 (secondary) #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20F32 #msc:68Q68

paper · pdf · doi:10.48550/arxiv.math/9812028

16 pages

arxiv created 1998/12/04 · arxiv updated 2009/11/30

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.

Related

• A note on Context Sensitive languages and Word Problems
• The (Nested) Word Problem
• Automata and Reduced Words in the Free Group
• The word and order problems for self-similar and automata groups
• The Word Problem of ℤⁿ Is a Multiple Context-Free Language