Work

Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems

Year: 2009

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.3.5

Author: M. Sakthi Balan

Institution: Infosys (India)

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2162105072

FWCI: 0.32

Cites: 8

Cited by: 14

Related to: 10