Journalartikel

Jahr der Veröffentlichung: 2011

Seiten: 1577-1592

Zeitschrift: International Journal of Foundations of Computer Science

Bandnummer: 22

Heftnummer: 7

ISSN: 0129-0541

eISSN: 1793-6373

DOI Link: https://doi.org/10.1142/S0129054111008891

Verlag: World Scientific Publishing

Abstract: 
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 multi-head 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.

Harvard-Zitierstil: Bordihn, H., Kutrib, M. and Malcher, A. (2011) UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA, International Journal of Foundations of Computer Science, 22(7), pp. 1577-1592. https://doi.org/10.1142/S0129054111008891

APA-Zitierstil: Bordihn, H., Kutrib, M., & Malcher, A. (2011). UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA. International Journal of Foundations of Computer Science. 22(7), 1577-1592. https://doi.org/10.1142/S0129054111008891