Abstract
P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the area are completeness (solving every solvable problem) and efficiency (solving a hard problem in feasible time). In this paper we define a general class of P systems covering some biological operations with membranes. We introduce a new operation, called replicative-distribution, into P systems with active membranes. This operation is well motivated from a biological point of view, and elegant from a mathematical point of view. It is both computationally powerful and efficient. More precisely, the P systems with active membranes using replicative-distribution rules can compute exactly what Turing machines can compute, and can solve NP-complete problems, particularly SAT, in linear time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adlmen, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Alhazov, A., Ishdorj, T.-O.: Membrane Operations in P Systems with Active Membranes. In: Păun, G., et al. (eds.) Second Brainstorming Week on Membrane Computing, February 2-7. Research Group in Natural Computing TR 01/2004, pp. 37–44. University of Sevilla, Sevilla (2004)
Alhazov, A., Pan, L., Păun, G.: Trading Polarizations for Labels in P Systems with Active Membranes (2003) (submitted)
Calude, C., Păun, G., Rozenberg, G., Salomaa, A. (eds.): Multiset Processing. LNCS, vol. 2235. Springer, Heidelberg (2001)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Garey, M.R., Johnson, D.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Pan, L., Alhazov, A., Ishdorj, T.-O.: Further Remarks on P Systems with Active Membranes, Separation, Merging and Release Rules. Soft Computing 8, 1–5 (2004)
Pan, L., Ishdorj, T.-O.: P Systems with Active Membranes and Separation Rules. Journal of Universal Computer Science 10(5), 630–649 (2004)
Papadimitriou, C.P.: Computational Complexity. Addison-Wesley, Reading (1994)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); TUCS Research Report 208 (1998) http://www.tucs.fi
Păun, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity Classes in Models of Cellular Computation with Membranes. Natural Computing 2(3), 265–285 (2003)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en Modelos de Computatión Celular con Membranas. Editorial Kronos, Sevilla (2002)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Salomaa, A., Rozenberg, G. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Shepherd, G.M.: Neurobiology. Oxford University Press, Oxford (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishdorj, TO., Ionescu, M. (2005). Replicative – Distribution Rules in P Systems with Active Membranes. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-31862-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25304-4
Online ISBN: 978-3-540-31862-0
eBook Packages: Computer ScienceComputer Science (R0)