# P Systems with Active Membranes: Attacking NP-Complete Problems

@article{Paun2001PSW, title={P Systems with Active Membranes: Attacking NP-Complete Problems}, author={Gheorghe Paun}, journal={J. Autom. Lang. Comb.}, year={2001}, volume={6}, pages={75-90} }

P systems are parallel Molecular Computing models based on processing multisets of objects in cell-like membrane structures. Various variants were already shown to be computationally universal, equal in power to Turing machines. In this paper one proposes a class of P systems whose membranes are the main active components, in the sense that they directly mediate the evolution and the communication of objects. Moreover, the membranes can multiply themselves by division. We prove that this…

## 355 Citations

P systems with active membranes: trading time for space

- Computer ScienceNatural Computing
- 2010

This model of P systems having three polarizations associated to the membranes is considered, and it is shown that they are able to solve the PSPACE-complete problem Quantified 3SAT when working in polynomial space and exponential time.

Computing with Membranes: Attacking NP-Complete Problems

- Computer ScienceUMC
- 2000

The aim of this paper is to introduce to the reader the main ideas of Computing with Membranes, a recent branch of (theoretical) Molecular Computing, with emphasis on some variants which can solve…

Replicative - Distribution Rules in P Systems with Active Membranes

- Computer ScienceICTAC
- 2004

A new operation, called replicative-distribution, is introduced into P systems with active membranes that can compute exactly what Turing machines can compute, and can solve NP-complete problems, particularly SAT, in linear time.

Membrane computing and complexity theory: A characterization of PSPACE

- Computer ScienceJ. Comput. Syst. Sci.
- 2007

Recent complexity-theoretic results on P systems with active membranes

- Computer ScienceJ. Log. Comput.
- 2015

This paper focuses on the complexity theory of P systems with active membranes, a variant of P system where the membranes themselves affect the applicability of rules and change during computations.

A GAP IN THE SPACE HIERARCHY OF P SYSTEMS WITH ACTIVE MEMBRANES

- Computer Science
- 2014

We prove that uniform families of P systems with active membranes using logarithmic workspace, in addition to a polynomial number of read-only input objects, can efficiently simulate polynomial-space…

Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes

- Computer Science, MathematicsFundam. Informaticae
- 2003

This paper partially confirms the conjecture proving that dissolving rules are not necessary for non-elementary membrane division, and the construction of a semi-uniform family of P systems is confirmed.

P Systems with Mobile Membranes

- Computer ScienceNatural Computing
- 2005

This paper investigates the power and the efficiency of P systems with active membranes by first proving that they can simulate and give a direct and simple proof for the universality result – without using division rules.

The computational power of timed P systems with active membranes using promoters

- Computer ScienceMathematical Structures in Computer Science
- 2018

This paper proposes a new variant of timed P systems with active membranes, where the application of rules can be regulated by promoters with only two polarizations, and proves that any Turing computable set of numbers can be generated by such a P system in the time-free way.

## References

SHOWING 1-10 OF 12 REFERENCES

On the Power of Membrane Computing

- Computer ScienceJ. Univers. Comput. Sci.
- 1999

This work compares transition super-cell systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (the authors take the Parikh image of the usual language generated by these mechanisms rather than the language).

Computing with Membranes

- Computer ScienceJ. Comput. Syst. Sci.
- 2000

It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.

Using DNA to Solve NP-Complete ProblemsRichard

- Computer Science
- 1995

We show how to use DNA experiments to solve the famous \SAT" problem of Computer Science. This is a special case of a more general method that can solve NP-complete problems, rst introduced in 3].…

Computing with membranes. A variant, submitted, 1999 see also CDMTCS Report No

- CS Department
- 1999

Membrane computing based on splicing, submitted Simulating H systems by P systems, submitted On synchronization in P systems, submitted, 1999 see also CS Department TR No 539

- Univ. of Western Ontario
- 1999

Membrane computing with external output, submitted

- TUCS Research Report No
- 1999

P systems on graphs of restricted forms, submitted

- P systems on graphs of restricted forms, submitted
- 1999

aun, Computing with membranes

- A variant, submitted,
- 1999

Membrane computing with external output , submitted

- Membrane computing with external output , submitted
- 1998

New Computing Paradigms

- New Computing Paradigms
- 1998