PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES

Abstract

An accepting device based on the communication between finite automata working in parallel is introduced. It consists of several finite automata working independently but communicating states to each other by request. Several variants of parallel communicating finite automata systems are investigated from their computational power point of view. We prove that all of them are at most as powerful as multi-head finite automata. Homomorphical characterizations of recursively enumerable languages are obtained starting from languages recognized by all variants of parallel communicating finite automata systems having at most three components. We present a brief comparison with the parallel communicating grammar systems. Some remarks suggesting that these devices might be mildly context-sensitive ones as well as a few open problems and directions for further research are also discussed.