Distributed pushdown automata systems: computational power

Authors:
Erzsébet Csuhaj-Varjú;Victor Mitrana;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania and Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 5
Cited 2

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Stack cooperation in multistack pushdown automata

Journal of Computer and System Sciences
Some undecidable problems for parallel communicating finite automata systems

Information Processing Letters
Handbook of Formal Languages

Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Parallel communicating Watson-Crick automata systems

Acta Cybernetica
Uniform distributed pushdown automata systems

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce distributed pushdown automata systems consisting of several pushdown automata which work in turn on the input string placed on a common one-way input tape. The work of the components is based on protocols and strategies similar to those that cooperating distributed grammar systems use. We investigate the computational power of these mechanisms under different protocols for activating components and two ways of accepting the input string: with empty stacks or with final states which means that all components have empty stacks or are in final states, respectively, when the input string was completely read.