On Variants of Communicating Distributed H Systems

Article type: Research Article

Authors: Frisco, Pierluigi | Zandron, Claudio

Affiliations: L.I.A.C.S., Leiden University, Niels Bohwerg 1, 2333 CA Leiden, The Netherlands Niels Bohwerg 1, 2333 CA Leiden, The Netherlands | D.I.S.Co. Università di Milano - Bicocca, v. Bicocca degli Arcimboldi 8, 20126 Milano, Italy

Abstract: A recent result shows that a variant of communicating distributed H system with two components can generate recursive enumerable languages. In this variant the filters are a finite union of sets whose number depends upon the simulated system. We prove here that it is possible to obtain the same result using filters testing the presence of couples of symbols. The number of the couples does not depend upon the simulated systems. Moreover we investigate variants of communicating distributed H systems with limitations in the redistribution process.

Keywords: Distributed H systems, splicing operation, two symbols filter

Journal: Fundamenta Informaticae, vol. 48, no. 1, pp. 9-20, 2001