Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-07-29
EPTCS 3, 2009, pp. 59-68
Computer Science
Formal Languages and Automata Theory
Scientific paper
10.4204/EPTCS.3.5
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.
No associations
LandOfFree
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-521458