Abstract
In the last time, several efforts were made in order to remove the polarization of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of power represented by avoiding polarizations, we introduce tables of rules: each membrane has associated several sets of rules, one of which is non-deterministically chosen in each computation step. Three universality results for tabled P systems are given, trying to use rules of as few as possible types. Then, we consider tables with obligatory rules – rules which must be applied at least once when the table is applied. Systems which use tables with at most one obligatory rule are proven to be able to solve SAT problem in linear time. Several open problems are also formulated.
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., Freund, R.: P systems with active membranes and two polarizations. In: Proc. Second Brainstorming Week on Membrane Computing, Sevilla, February 2004, TR 01/04 of Research Group on Natural Computing, Sevilla University, pp. 20–36 (2004)
Alhazov, A., Pan, L.: Polarizationless P systems with active membranes. Grammars, 7, 1 (2004)
Alhazov, A., Pan, L., Păun, G.: Trading polarizations for labels in P systems with active membranes (submitted 2003)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science (in press)
Hauschild, D., Jantzen, M.: Petri nets algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Pérez-Jiménez, M., Roméro-Jimenez, A., Sancho-Caparrini, F.: Teoría de la complejidad en modelos de computación celular con membranas, Kronos Editorial, Sevilla (2002)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1997)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2004). P Systems with Tables of Rules. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-27812-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22393-1
Online ISBN: 978-3-540-27812-2
eBook Packages: Springer Book Archive