Multipass automata and group word problems - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2015

Multipass automata and group word problems

Abstract

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 and versions

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

Identifiers

Cite

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 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More