Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems
Formal Languages and Automata Theory
2009-07-30 v1 Computation and Language
Distributed, Parallel, and Cluster Computing
Abstract
We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown automata (RCPCPA), is equivalent to that of multi-head pushdown automata. The above result presents a new sub-class of returning parallel communicating pushdown automata systems (RPCPA) called simple-RPCPA and we show that it can be written as a finite intersection of multi-head pushdown automata systems.
Cite
@article{arxiv.0907.5083,
title = {Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems},
author = {M. Sakthi Balan},
journal= {arXiv preprint arXiv:0907.5083},
year = {2009}
}