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

Simple item page
dc.creatorShapiro, Robert Gilman Michael
dc.date1998-12-04
dc.date.accessioned2026-07-07T05:27:07Z
dc.date.available2026-07-07T05:27:07Z
dc.descriptionAccessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/9812028
dc.identifierhttp://arxiv.org/abs/math/9812028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77803
dc.subjectGroup Theory
dc.subject20F32 (primary), 68Q68 (secondary)
dc.titleOn groups whose word problem is solved by a nested stack automaton
dc.typetext

Files

Collections

arXiv