Finite dp automata versus multi-head finite automata

Authors:
Erzsébet Csuhaj-Varjú;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 7
Cited 2

Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P Automata or Purely Communicating Accepting P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the Computational Complexity of P Automata

Natural Computing: an international journal
On multi-head finite automata

IBM Journal of Research and Development
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science

P and dp automata: unconventional versus classical automata

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
P automata revisited

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.