Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted, that is, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. The computational power and decidability problems are studied for returning systems, where components are set back to their initial states after having answered communication requests. It is proved that an infinite, strict hierarchy of language families exists, induced by the number of messages sent by their most economical acceptors. It is shown that at least one gap in this hierarchy exists. Some levels in the hierarchy are investigated in more detail.
['Henning Bordihn', 'Martin Kutrib', 'Andreas Malcher']
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities