Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
A boundary result on enhanced time-varying distributed H systems with parallel computations
Theoretical Computer Science
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)
On Variants of Communicating Distributed H Systems
Fundamenta Informaticae
On length-separating test tube systems
Natural Computing: an international journal
A small universal splicing P system
CMC'10 Proceedings of the 11th international conference on Membrane computing
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 0.00 |
Splicing test tube systems are one of the first distributed computing models based on splicing. The model introduces (test) tubes where the splicing operation is applied, which are arranged in a communication network with filters that permits to redistribute the words between the tubes at each step. We show that the computational completeness can be achieved with two tubes when the communication graph does not have self-loops. We also construct a universal splicing test tube system with 2 tubes having 23 rules.