Abstract
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be applied. In this paper, we consider the minimal parallelism for P systems with active membranes without polarizations, using additional features, such as separation operations, changing membrane labels, catalytic or cooperative rules, etc. With several combinations of such features we obtain computational completeness. In cases where membrane division (of elementary or non-elementary membranes) is allowed, we show how SAT can be solved in polynomial 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
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, Sevilla, TR 01/2004, University of Sevilla, February 2-7, pp. 37–44 (2004)
Alhazov, A., Pan, L., Păun, G.: Trading Polarizations for Labels in P Systems with Active Membranes. Acta Informaticae 41(2-3), 111–144 (2004)
Ciobanu, G., Pan, L., Păun, G., Pérez-Jiménez, M.J.: P Systems with Minimal Parallelism (submitted, 2005)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
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.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, G.: Membrane Computing: 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishdorj, TO. (2006). Minimal Parallelism for Polarizationless P Systems. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_2
Download citation
DOI: https://doi.org/10.1007/11925903_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49024-1
Online ISBN: 978-3-540-68423-7
eBook Packages: Computer ScienceComputer Science (R0)