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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.