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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
16 pages

Keywords

Group Theory, 20F32 (primary), 68Q68 (secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/77803

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9812028
 http://arxiv.org/abs/math/9812028

Collections

arXiv