Regular extended H systems are computationally universal
Journal of Automata, Languages and Combinatorics
Controlled H systems of small radius
Fundamenta Informaticae
Nine test tubes generate any RE language
Theoretical Computer Science - Special issue on universal machines and computations
Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
A Reduced Distributed Splicing System for RE Languages
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Universality of Splicing Test Tube Systems with Two Tubes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |
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.