Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
On small universal antiport P systems
Theoretical Computer Science
Computing with Cells: Advances in Membrane Computing
Computing with Cells: Advances in Membrane Computing
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Universality of Splicing Test Tube Systems with Two Tubes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
In this article we present a universal splicing P system with 6 rules. Thus we improve the previous result that used 8 rules and lower the possible value for the boundary between the universality and nonuniversality for such systems.