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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/77803Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.16 pagesGroup Theory20F32 (primary), 68Q68 (secondary)On groups whose word problem is solved by a nested stack automatontext