{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:25Z","timestamp":1742913025957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030127961"},{"type":"electronic","value":"9783030127978"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12797-8_4","type":"book-chapter","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T19:06:50Z","timestamp":1548961610000},"page":"33-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tissue P Systems with Point Mutation Rules"],"prefix":"10.1007","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,1]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-14370-5_7","volume-title":"Membrane Computing","author":"A Alhazov","year":"2014","unstructured":"Alhazov, A., Freund, R.: P systems with toxic objects. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sos\u00edk, P., Zandron, C. (eds.) CMC 2014. LNCS, vol. 8961, pp. 99\u2013125. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14370-5_7"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-36751-9_9","volume-title":"Membrane Computing","author":"Artiom Alhazov","year":"2013","unstructured":"Alhazov, A., Freund, R., Heikenw\u00e4lder, H., Oswald, M., Rogozhin, Yu., Verlan, S.: Sequential P systems with regular control. In: Csuhaj-Varj\u00fa, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, Gy. (eds.) CMC 2012. LNCS, vol. 7762, pp. 112\u2013127. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36751-9_9"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.4204\/EPTCS.252.6","volume":"252","author":"Artiom Alhazov","year":"2017","unstructured":"Alhazov, A., Freund, R., Ivanov, S., Verlan, S.: (tissue) P systems with vesicles of multisets. In: Csuhaj-Varj\u00fa, E., D\u00f6m\u00f6si, P., Vaszil, Gy. (eds.) Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, 4\u20136 September 2017. EPTCS, vol. 252, pp. 11\u201325 (2017). https:\/\/doi.org\/10.4204\/EPTCS.252.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-54072-6_6","volume-title":"Membrane Computing","author":"A Alhazov","year":"2017","unstructured":"Alhazov, A., Freund, R., Verlan, S.: P systems working in maximal variants of the set derivation mode. In: Leporati, A., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2016. LNCS, vol. 10105, pp. 83\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54072-6_6"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-14370-5_9","volume-title":"Membrane Computing","author":"B Aman","year":"2014","unstructured":"Aman, B., Csuhaj-Varj\u00fa, E., Freund, R.: Red\u2013green P automata. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sos\u00edk, P., Zandron, C. (eds.) CMC 2014. LNCS, vol. 8961, pp. 139\u2013157. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14370-5_9"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ic.2016.06.004","volume":"253","author":"Fernando Arroyo","year":"2017","unstructured":"Arroyo, F., G\u00f3mez-Canaval, S., Mitrana, V., Popescu, \u015e.: On the computational power of networks of polarized evolutionary processors. Inf. Comput. 253(3), 371\u2013380 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.06.004","journal-title":"Information and Computation"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-04921-2_8","volume-title":"Language and Automata Theory and Applications","author":"F Arroyo","year":"2014","unstructured":"Arroyo, F., G\u00f3mez Canaval, S., Mitrana, V., Popescu, \u015e.: Networks of polarized evolutionary processors are computationally complete. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 101\u2013112. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04921-2_8"},{"issue":"1-3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.biosystems.2004.05.032","volume":"77","author":"Cristian S. Calude","year":"2004","unstructured":"Calude, C.S., P\u0103un, Gh.: Bio-steps beyond Turing. BioSystems 77(1\u20133), 175\u2013194 (2004)","journal-title":"Biosystems"},{"issue":"6\u20137","key":"4_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s00236-004-0158-7","volume":"39","author":"J Castellanos","year":"2003","unstructured":"Castellanos, J., Mart\u00edn-Vide, C., Mitrana, V., Sempere, J.M.: Networks of evolutionary processors. Acta Informatica 39(6\u20137), 517\u2013529 (2003). https:\/\/doi.org\/10.1007\/s00236-004-0158-7","journal-title":"Acta Informatica"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-74932-2_10","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J\u00fcrgen Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, Gh.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Dassow, J., P\u0103un, Gh.: On the power of membrane computing. J. UCS 5(2), 33\u201349 (1999). https:\/\/doi.org\/10.3217\/jucs-005-02-0033","DOI":"10.3217\/jucs-005-02-0033"},{"issue":"11","key":"4_CR12","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s002360050108","volume":"34","author":"H Fernau","year":"1997","unstructured":"Fernau, H.: Unconditional transfer in regulated rewriting. Acta Informatica 34(11), 837\u2013857 (1997). https:\/\/doi.org\/10.1007\/s002360050108","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"4_CR13","first-page":"117","volume":"12","author":"H Fernau","year":"2007","unstructured":"Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Comb. 12(1\u20132), 117\u2013138 (2007)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-30550-7_16","volume-title":"Developments in Language Theory","author":"R Freund","year":"2004","unstructured":"Freund, R.: P systems working in the sequential mode on arrays and strings. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 188\u2013199. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30550-7_16"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1142\/S0129054105003224","volume":"16","author":"R Freund","year":"2005","unstructured":"Freund, R.: P systems working in the sequential mode on arrays and strings. Int. J. Found. Comput. Sci. 16(4), 663\u2013682 (2005). https:\/\/doi.org\/10.1142\/S0129054105003224","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR16","unstructured":"Freund, R., Ibarra, O., P\u0103un, Gh., Yen, H.C.: Matrix languages, register machines, vector addition systems. In: Third Brainstorming Week on Membrane Computing, pp. 155\u2013167 (2005)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-21819-9_12","volume-title":"Unconventional Computation and Natural Computation","author":"R Freund","year":"2015","unstructured":"Freund, R., Ivanov, S., Staiger, L.: Going beyond turing with P automata: partial adult halting and regular observer $$\\omega $$ -languages. In: Calude, C.S., Dinneen, M.J. (eds.) UCNC 2015. LNCS, vol. 9252, pp. 169\u2013180. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21819-9_12"},{"issue":"1","key":"4_CR18","first-page":"51","volume":"12","author":"R Freund","year":"2016","unstructured":"Freund, R., Ivanov, S., Staiger, L.: Going beyond Turing with P automata: regular observer $$\\omega $$ -languages and partial adult halting. IJUC 12(1), 51\u201369 (2016)","journal-title":"IJUC"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-20000-7_5","volume-title":"Computation, Cooperation, and Life","author":"R Freund","year":"2011","unstructured":"Freund, R., Kogler, M., Oswald, M.: A general framework for regulated rewriting based on the applicability of rules. In: Kelemen, J., Kelemenov\u00e1, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 35\u201353. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20000-7_5"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4204\/EPTCS.31.11","volume":"31","author":"Rudolf Freund","year":"2010","unstructured":"Freund, R., Kogler, M., Rogozhin, Yu., Verlan, S.: Graph-controlled insertiondeletion systems. In: Proceedings of Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8\u201310th August 2010, pp. 88\u201398 (2010). https:\/\/doi.org\/10.4204\/EPTCS.31.11","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2007.05.011","volume":"171","author":"R Freund","year":"2007","unstructured":"Freund, R., Oswald, M.: Tissue P systems and (mem)brane systems with mateand drip operations working on strings. Electron. Notes Theor. Comput. Sci. 171(2), 105\u2013115 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.05.011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24619-0_15","volume-title":"Membrane Computing","author":"Rudolf Freund","year":"2004","unstructured":"Freund, R., Oswald, M., Staiger, L.: $$\\omega $$ -P automata with communication rules. In: Mart\u00edn-Vide, C., Mauri, G., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203\u2013217. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24619-0_15"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4204\/EPTCS.128.13","volume":"128","author":"Rudolf Freund","year":"2013","unstructured":"Freund, R., P\u0103un, Gh.: How to obtain computational completeness in P systems with one catalyst. In: 2013 Proceedings of Machines, Computations and Universality, MCU 2013, Z\u00fcrich, Switzerland, 9\u201311 September 2013, pp. 47\u201361 (2013). https:\/\/doi.org\/10.4204\/EPTCS.128.13","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-60252-3_11","volume-title":"Descriptional Complexity of Formal Systems","author":"R Freund","year":"2017","unstructured":"Freund, R., Rogojin, V., Verlan, S.: Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 140\u2013151. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_11"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-013-9396-3","volume":"13","author":"Rudolf Freund","year":"2014","unstructured":"Freund, R., Rogozhin, Yu., Verlan, S.: Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2), 257\u2013268 (2014). https:\/\/doi.org\/10.1007\/s11047-013-9396-3","journal-title":"Natural Computing"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45523-X_7","volume-title":"Lecture Notes in Computer Science","author":"Manfred Kudlek","year":"2001","unstructured":"Kudlek, M., Mart\u00edn-Vide, C., P\u0103un, Gh.: Toward a formal macroset theory. In: Calude, C.S., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2000. LNCS, vol. 2235, pp. 123\u2013133. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45523-X_7"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2011.12.040","volume":"429","author":"J Leeuwen van","year":"2012","unstructured":"van Leeuwen, J., Wiedermann, J.: Computation as an unbounded process. Theor. Comput. Sci. 429, 202\u2013212 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.040","journal-title":"Theor. Comput. Sci."},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45655-4_32","volume-title":"Lecture Notes in Computer Science","author":"C. Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide, C., Pazos, J., P\u0103un, Gh., Rodr\u00edguez-Pat\u00f3n, A.: A new class of symbolic abstract neural nets: tissue P systems. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 290\u2013299. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45655-4_32"},{"key":"4_CR29","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)"},{"key":"4_CR30","unstructured":"Oswald, M.: P automata. Ph.D. thesis, Faculty of Computer Science, Vienna University of Technology (2003)"},{"key":"4_CR31","unstructured":"Popescu, \u015e.: Networks of polarized evolutionary processors with elementary polarization of symbols. In: NCMA 2016, pp. 275\u2013285 (2016)"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gheorghe P\u0103un","year":"2000","unstructured":"P\u0103un, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000). https:\/\/doi.org\/10.1006\/jcss.1999.1693","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)","DOI":"10.1007\/978-3-642-11467-0"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"4_CR34","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1\u20133. Springer, Heidelberg (1997)"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11603047_5","volume-title":"Membrane Computing","author":"Petr Sos\u00edk","year":"2006","unstructured":"Sos\u00edk, P., Val\u00edk, O.: On evolutionary lineages of membrane systems. In: Freund, R., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 67\u201378. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11603047_5"},{"key":"4_CR36","unstructured":"Bulletin of the International Membrane Computing Society (IMCS). http:\/\/membranecomputing.net\/IMCSBulletin\/index.php"},{"key":"4_CR37","unstructured":"The P Systems Website. http:\/\/ppage.psystems.eu\/"}],"container-title":["Lecture Notes in Computer Science","Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12797-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T05:48:49Z","timestamp":1662875329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12797-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030127961","9783030127978"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12797-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Membrane Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"membrane2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cmc19.uni-jena.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"75% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}