Multipass automata and group word problems - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Multipass automata and group word problems

Résumé

We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the class of deterministic context-free languages while the class of languages accepted by nondeterministic multipass automata is exactly the class of poly-context-free languages, that is, languages which are the intersection of finitely many context-free languages. We illustrate the use of these automata by studying groups whose word problems are in the above classes.

Dates et versions

hal-01119199 , version 1 (21-02-2015)

Identifiants

Citer

Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp. Multipass automata and group word problems. Theoretical Computer Science, 2015, ⟨10.1016/j.tcs.2015.06.054⟩. ⟨hal-01119199⟩
115 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More