On the Computational Capacity of Parallel Communicating Finite Automata

Authors:
Henning Bordihn;Martin Kutrib;Andreas Malcher
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, Germany 14482;Institut für Informatik, Universität Giessen, Giessen, Germany 35392;Institut für Informatik, Universität Giessen, Giessen, Germany 35392
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 10
Cited 2

Multiprocessor automata

Information Processing Letters
Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
k + 1 Heads Are Better than k

Journal of the ACM (JACM)
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Power of Cooperation and Multihead Finite Systems

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Systems of communicating finite-state machines as a distributed alternative to finite-state machines

Systems of communicating finite-state machines as a distributed alternative to finite-state machines
On multi-head finite automata

IBM Journal of Research and Development
On two-way multihead automata

Journal of Computer and System Sciences
The boolean closure of growing context-sensitive languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Undecidability and hierarchy results for parallel communicating finite automata

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Systems of parallel finite automata communicating by states are investigated. We consider deterministic and nondeterministic devices and distinguish four working modes. It is known that systems in the most general mode are as powerful as one-way multihead finite automata. Here we solve some open problems on the computational capacity of systems working in the remaining modes. In particular, it is shown that deterministic returning and non-returning devices are equivalent, and that there are languages which are accepted by deterministic returning and centralized systems but cannot be accepted by deterministic non-returning centralized systems. Furthermore, we show that nondeterministic centralized systems are strictly more powerful than their deterministic variants. Finally, incomparability with the class of (deterministic) (linear) context-free languages as well as the Church-Rosser languages is derived.