Skip to main content
Conference Proceedings

Finite dP automata versus multi-head finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7184 LNCS 120-138
DOI: 10.1007/978-3-642-28024-5_10
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a connection between dP automata (distributed P automata) and non-deterministic multi-head finite automata. We introduce the concepts of agreement languages of dP automata, and the notion of a two-way dP automaton. We demonstrate how the languages of non-deterministic one-way and two-way multi-head finite automata can be obtained as the agreement languages of one-way and two-way finite dP automata. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Csuhaj-Varjú, E., & Vaszil, G. (2012). Finite dP automata versus multi-head finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 120–138). https://doi.org/10.1007/978-3-642-28024-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free