Reversible parallel communicating finite automata systems
Open Access
- 19 July 2021
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 58 (4) , 263-279
Abstract
We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.Keywords
Funding Information
- National Research, Development and Innovation Fund of Hungary (K 120558)
This publication has 17 references indexed in Scilit:
- Reversible Nondeterministic Finite Automata2017
- Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and UndecidabilitiesInternational Journal of Foundations of Computer Science, 2015
- Aspects of Reversibility for Classical Automata2014
- Reversible pushdown automataJournal of Computer and System Sciences, 2012
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATAInternational Journal of Foundations of Computer Science, 2012
- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space2012
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATAInternational Journal of Foundations of Computer Science, 2011
- Returning and non-returning parallel communicating finite automata are equivalentRAIRO - Theoretical Informatics and Applications, 2007
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Logical Reversibility of ComputationIBM Journal of Research and Development, 1973