Returning and non-returning parallel communicating finite automata are equivalent
A parallel communicating automata system consists of several automata working independently in parallel and communicating with each other by request with the aim of recognizing a word. Rather surprisingly, returning parallel communicating finite automata systems are equivalent to the non- returning variants. We show this result by proving the equivalence of both with multihead finite automata. Some open problems are finally formulated.
parallel communicating finite automata system formal languages multihead finite automaton computational power