Abstract
The purpose of this paper is to propose a new kind of P system based on hypergraph. This paper proposes the concept of hypergraph in mathematical space and combines hypergraph with cell membrane to construct a new P system. Specifically, this new membrane system incorporates the interrelationship of hyperedges in hypergraphs and introduces the concept of weight and directionality of hypergraphs. At the same time, we have written new, more convenient rules for this new membrane system. This will be the first combination of hypergraph and membrane calculation, which brings a new theoretical method for membrane calculation. Through the simulation of the register machine, the computational completeness of the hypergraph P system is proved.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Păun, G., Rozenberg, G., Salomaa, A.: Membrane Computing. Oxford University Press, New York (2010)
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1024 (1994)
Lipton, R.J.: DNA solution of hard computational problems. Science 268(5210), 542–545 (1995)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing, New Computing Paradigms. Springer, Heidelberg (2010)
Ishdorj, T.-O., Leporati, A., Pan, L., Zeng, X., Zhang, X.: Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Theoret. Comput. Sci. 411(25), 2345–2358 (2010)
Linqiang, P., Alhazov, A.: Solving HPP and SAT by P systems with active membranes and separation rules. Acta Informatica 43(2), 131–145 (2006)
Linqiang, P., Martín-Vide, C.: Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes. J. Parallel Distrib. Comput. 65(12), 1578–1584 (2005)
Ishdorj, T.-O., Leporati, A., Pan, L., Wang, J.: Solving NP-complete problems by spiking neural P systems with budding rules. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 335–353. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11467-0_24
Linqiang, P., Zeng, X., Zhang, X., Jiang, Y.: Spiking neural P systems with weighted synapses. Neural Process. Lett. 35(1), 13–27 (2012)
Păun, G.: A quick introduction to membrane computing. J. Logic Algebraic Program. 79(6), 291–294 (2010)
Robin, F.: Users guide to discrete Morse theory. Séminaire Lotharingien de Combinatoire 48, 1–35 (2002). Article B48c
Han, J., Kamber, M.: Data Mining. Concepts and Techniques. Morgan Kaufmann Publishers, Higher Education Press, Beijing (2002)
Ceterchi, R., Martin-Vide, C.: P systems with communication for static sorting. GRLMC Report 26, Rovira I Virgili University (2003). Cavaliere, M., Martín-Vide, C., Paun, Gh. (eds.)
Minsky, M.: Computation Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
The Hypergraph Web Page. https://en.wikipedia.org/wiki/Hypergraph
Acknowledgements
Project is supported by National Natural Science Foundation of China (61472231, 61502283, 61876101, 61802234, 61806114), Ministry of Eduction of Humanities and Social Science Research Project, China (12YJA630152), Social Science Fund Project of Shandong Province, China (16BGLJ06, 11CGLJ22), China Postdoctoral Project (40411583).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, W., Liu, X. (2019). A New Communication P System Model Based on Hypergraph. In: Tang, Y., Zu, Q., Rodríguez García, J. (eds) Human Centered Computing. HCC 2018. Lecture Notes in Computer Science(), vol 11354. Springer, Cham. https://doi.org/10.1007/978-3-030-15127-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-15127-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15126-3
Online ISBN: 978-3-030-15127-0
eBook Packages: Computer ScienceComputer Science (R0)