Parallel communicating one-way reversible finite automata system

TL;DR

This paper demonstrates that parallel communicating one-way reversible finite automata systems can accept all regular languages, unlike multi-head one-way reversible automata, highlighting a unique computational capability of the former.

Contribution

It establishes that parallel communicating systems with reversible automata can accept all regular languages, unlike their multi-head counterparts, and explores their non-reversibility as a system.

Findings

Parallel communicating systems accept all regular languages.

Such systems are not reversible as a whole.

They may accept languages beyond multi-head reversible automata.

Abstract

In this paper, we discuss the computational power of parallel communicating finite automata system with 1-way reversible finite automaton as components. We show that unlike the multi-head one way reversible finite automata model (where we are still not sure whether it accepts all the regular languages) parallel communicating one-way reversible finite automata systems can accept all the regular languages. Moreover for every multi-head one way reversible finite automaton there exist a parallel communicating one-way reversible finite automata system which accepts the same language. We also make an interesting observation that although the components of the system are reversible the system as a whole is not reversible. On the basis of which we conjecture that parallel communicating one-way reversible finite automata systems may accept languages not accepted by multi-head one way reversible finite automata.