Parallel communicating pushdown automata systems

E. Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana, György Vaszil

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

Original languageEnglish
Pages (from-to)633-650
Number of pages18
JournalInternational Journal of Foundations of Computer Science
Volume11
Issue number4
DOIs
Publication statusPublished - 2000

Fingerprint

System theory
Communication

Keywords

  • n-head pushdown automata
  • parallel communicating systems
  • pushdown automata
  • two-stack pushdown automata

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Parallel communicating pushdown automata systems. / Csuhaj-Varjú, E.; Martín-Vide, Carlos; Mitrana, Victor; Vaszil, György.

In: International Journal of Foundations of Computer Science, Vol. 11, No. 4, 2000, p. 633-650.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Martín-Vide, Carlos ; Mitrana, Victor ; Vaszil, György. / Parallel communicating pushdown automata systems. In: International Journal of Foundations of Computer Science. 2000 ; Vol. 11, No. 4. pp. 633-650.
@article{3668c471f70e42f9b0166a7a4a615037,
title = "Parallel communicating pushdown automata systems",
abstract = "We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.",
keywords = "n-head pushdown automata, parallel communicating systems, pushdown automata, two-stack pushdown automata",
author = "E. Csuhaj-Varj{\'u} and Carlos Mart{\'i}n-Vide and Victor Mitrana and Gy{\"o}rgy Vaszil",
year = "2000",
doi = "10.1142/S0129054100000338",
language = "English",
volume = "11",
pages = "633--650",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Parallel communicating pushdown automata systems

AU - Csuhaj-Varjú, E.

AU - Martín-Vide, Carlos

AU - Mitrana, Victor

AU - Vaszil, György

PY - 2000

Y1 - 2000

N2 - We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

AB - We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

KW - n-head pushdown automata

KW - parallel communicating systems

KW - pushdown automata

KW - two-stack pushdown automata

UR - http://www.scopus.com/inward/record.url?scp=28244463323&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28244463323&partnerID=8YFLogxK

U2 - 10.1142/S0129054100000338

DO - 10.1142/S0129054100000338

M3 - Article

AN - SCOPUS:28244463323

VL - 11

SP - 633

EP - 650

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -