Parallel Communicating Finite Automata Systems (Algebraic Systems, Formal Languages and Computations)
Víctor Mitrana · Institutional Repositories DataBase (IRDB) · 2000
A parallel communicating finite automata system is an accepting device based on the communication between more finite automata working in par- allel.It consists of several automata working independently but communicating with each other by request.We survey several variants of parallel communicat- ing finite automata systems with respect to their computational power.Other aspects like decidability and complexity matters are also briefly discussed.Some open problems and directions for future research are finally pointed out.