On the rule complexity of universal tissue p systems

Authors:
Yurii Rogozhin;Sergey Verlan
Affiliations:
Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova;LACL, Université Paris XII, France
Venue:
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Year:
2005

Citing 6
Cited 10

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)
Computing with membranes

Journal of Computer and System Sciences
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Computation: finite and infinite machines

Computation: finite and infinite machines
Symport/Antiport P Systems with Three Objects Are Universal

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

On small universal antiport P systems

Theoretical Computer Science
The Complexity of Small Universal Turing Machines

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Smaller Universal Spiking Neural P Systems

Fundamenta Informaticae
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
How Redundant Is Your Universal Computation Device?

Membrane Computing
A small universal splicing P system

CMC'10 Proceedings of the 11th international conference on Membrane computing
The complexity of small universal turing machines: a survey

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Universality of Splicing Test Tube Systems with Two Tubes

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Smaller Universal Spiking Neural P Systems

Fundamenta Informaticae
Turing computability and membrane computing

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the last time several attempts to decrease different complexity parameters (number of membranes, size of rules, number of objects etc.) of universal P systems were done. In this article we consider another parameter which was not investigated yet: the number of rules. We show that 8 rules suffice to recognise any recursively enumerable language if splicing tissue P systems are considered.