Information Processing Letters
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Some undecidable problems for parallel communicating finite automata systems
Information Processing Letters
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Power of Cooperation and Multihead Finite Systems
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Descriptional complexity of cellular automata and decidability questions
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
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 the Computational Capacity of Parallel Communicating Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
IBM Journal of Research and Development
On stateless multihead automata: Hierarchies and the emptiness problem
Theoretical Computer Science
Journal of Computer and System Sciences
Hi-index | 0.00 |
Parallel communicating finite automata (PCFAs) are systems of several finite state automata which process a common input string in a parallel way and are able to communicate by sending their states upon request. We consider deterministic and nondeterministic variants and distinguish four working modes. It is known that these systems in the most general mode are as powerful as one-way multihead finite automata. It is additionally known that the number of heads corresponds to the number of automata in PCFAs in a constructive way. Thus, undecidability results as well as results on the hierarchies induced by the number of heads carry over from multi-head finite automata to PCFAs in the most general mode. Here, we complement these undecidability and hierarchy results also for the remaining working modes. In particular, we show that classical decidability questions are not semi-decidable for any type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.