RO EN
Minimal Parallelism and Number of Membrane Polarizations
Authors: Alhazov Artiom
In particular, we show that it is enough to have four polarizations, sequential evolution rules changing polarizations, polarizationless non-elementary membrane division rules and polarizationless rules of sending an object out. The same problem is solved with the standard evolution rules, rules of sending an object out and polarizationless non-elementary membrane division rules, with six polarizations. It is an open question whether these numbers are optimal.
– 0.19 Mb
Abstract
It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P systems with active membranes with two polarizations working in a maximally parallel way. We study P systems with active membranes without non-elementary membrane division, working in minimally parallel way. The main question we address is what number of polarizations is sufficient for an efficient computation depending on the types of rules used.In particular, we show that it is enough to have four polarizations, sequential evolution rules changing polarizations, polarizationless non-elementary membrane division rules and polarizationless rules of sending an object out. The same problem is solved with the standard evolution rules, rules of sending an object out and polarizationless non-elementary membrane division rules, with six polarizations. It is an open question whether these numbers are optimal.
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD 2028, Moldova
E-mail:
FCS, Department of Information Engineering,
Graduate School of Engineering
Hiroshima University,
Higashi-Hiroshima 739-8527 Japan
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD 2028, Moldova
E-mail:
FCS, Department of Information Engineering,
Graduate School of Engineering
Hiroshima University,
Higashi-Hiroshima 739-8527 Japan
Fulltext
Contents
- Gheorghe Pãun (A tribute in honour of his 60th birthday)
- Investigations on Natural Computing in the Institute of Mathematics and Computer Science
- Membrane Systems Languages Are Polynomial-Time Parsable
- Minimal Parallelism and Number of Membrane Polarizations
- On computational properties of gene assembly in ciliates
- Recent Developments on Insertion-Deletion Systems
- Simulator of P-Systems with String Replication Developed in Framework of P-Lingua 2.1