Systolic automata and p systems

Abstract

Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips. In this paper we investigate the relationship between Binary Systolic Tree Automata (BSTA), in which the underlying communication structure is an infinite complete binary tree with parallel bottom-up computation, andPsystems, a biologically-inspired formalism based on rewrite rules acting upon multisets of symbols with a maximally-parallel semantics. In particular, we propose a variant of BSTA as multiset languages acceptors, termed Multiset BSTA. By exploiting the similarity in the parallel computation as performed in both BSTA and P systems, we show how a Multiset BSTA can be simulated by a cooperative P system while preserving the computational efficiency of systolic automata.