Abstract
The concept of a matter object being annihilated when meeting its corresponding anti-matter object is investigated in the context of membrane systems, i.e., of (distributed) multiset rewriting systems applying rules in the maximally parallel way. Computational completeness can be obtained with using only non-cooperative rules besides these matter/anti-matter annihilation rules if these annihilation rules have priority over the other rules. Without this priority condition, in addition catalytic rules with one single catalyst are needed to get computational completeness. Even deterministic systems are obtained in the accepting case. Universal P systems with a rather small number of rules – 57 for computing systems, 59 for generating and 53 for accepting systems – can be constructed when using non-cooperative rules together with matter/anti-matter annihilation rules having weak priority.
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., Sburlan, D.: Static Sorting P Systems. In: Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.) Applications of Membrane Computing. Natural Computing Series, pp. 215–252. Springer (2005)
Csuhaj-Varjú, E., Vaszil, G.: P Automata or Purely Communicating Accepting P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC-CdeA 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally Universal P Systems without Priorities: Two Catalysts Are Sufficient. Theoretical Computer Science 330, 251–266 (2005)
Freund, R., Oswald, M.: A Small Universal Antiport P System with Forbidden Context. In: Leung, H., Pighizzini, G. (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006, June 21-23. Proceedings DCFS, pp. 259–266. New Mexico State University, Las Cruces (2006)
Freund, R., Oswald, M.: Catalytic and Purely Catalytic P Automata: Control Mechanisms for Obtaining Computational Completeness. In: Bensch, S., Drewes, F., Freund, R., Otto, F. (eds.) Fifth Workshop on Non-Classical Models of Automata and Applications (NCMA 2013), pp. 133–150. OCG, Wien (2013)
Freund, R.: Gh. Păun: How to Obtain Computational Completeness in P Systems with One Catalyst. In: Proceedings Machines, Computations and Universality, MCU 2013, Zürich, Switzerland, September 9-11. EPTCS, vol. 128, pp. 47–61 (2013)
Korec, I.: Small Universal Register Machines. Theoretical Computer Science 168, 267–301 (1996)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Pan, L., Păun, G.: Spiking Neural P Systems with Anti-Matter. International Journal of Computers, Communications & Control 4(3), 273–282 (2009)
Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); (Turku Center for Computer Science-TUCS Report 208 (November 1998), www.tucs.fi )
Păun, G.: Membrane Computing. An Introduction. Springer (2002)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer (1997)
The P Systems Website, www.ppage.psystems.eu
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Alhazov, A., Aman, B., Freund, R., Păun, G. (2014). Matter and Anti-Matter in Membrane Systems. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-09704-6_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09703-9
Online ISBN: 978-3-319-09704-6
eBook Packages: Computer ScienceComputer Science (R0)