{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:46:55Z","timestamp":1759366015568,"version":"build-2065373602"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009232","name":"University of Debrecen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009232","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We demonstrate that languages of non-cooperative polymorphic P\u00a0systems with no ingredients (with no special features and no target indicators in the rules) can be generated by nonreturning parallel communicating ET0L systems, and discuss a further topic for research, namely the identification of the subclass of parallel communicating ET0L systems for which the converse of the statement holds, that is, the precise characterization of languages of non-cooperative polymorphic P systems in terms of the parallel communicating Lindenmayer system model.<\/jats:p>","DOI":"10.1007\/s41965-025-00185-0","type":"journal-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T20:41:17Z","timestamp":1743799277000},"page":"312-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-cooperative polymorphic P\u00a0systems and parallel communicating ET0L systems"],"prefix":"10.1007","volume":"7","author":[{"given":"Anna","family":"Kuczik","sequence":"first","affiliation":[]},{"given":"Gy\u00f6rgy","family":"Vaszil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,3]]},"reference":[{"key":"185_CR1","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2018.07.016","volume":"805","author":"A Alhazov","year":"2020","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). P systems with randomized right-hand sides of rules. Theoretical Computer Science, 805, 144\u2013160. https:\/\/doi.org\/10.1016\/j.tcs.2018.07.016","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"185_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s11047-019-09747-5","volume":"18","author":"A Alhazov","year":"2019","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2019). Variants of P systems with activation and blocking of rules. Natural Computing, 18(3), 593\u2013608. https:\/\/doi.org\/10.1007\/s11047-019-09747-5","journal-title":"Natural Computing"},{"key":"185_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-18123-8_9","volume":"2","author":"A Alhazov","year":"2016","unstructured":"Alhazov, A., Ivanov, S., & Freund, R. (2016). Polymorphic P systems: A survey. Bulletin of the International Membrane Computing Society, 2, 79\u2013101. https:\/\/doi.org\/10.1007\/978-3-642-18123-8_9","journal-title":"Bulletin of the International Membrane Computing Society"},{"key":"185_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-18123-8_9","volume-title":"Membrane Computing. Lecture Notes in Computer Science","author":"A Alhazov","year":"2011","unstructured":"Alhazov, A., Ivanov, S., & Rogozhin, Y. (2011). Polymorphic P systems. In M. Gheorghe, T. Hinze, G. P\u0103un, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing. Lecture Notes in Computer Science (Vol. 6501, pp. 81\u201394). Berlin, Heidelberg: Springer-Verlag. https:\/\/doi.org\/10.1007\/978-3-642-18123-8_9"},{"key":"185_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114062","volume":"971","author":"B Aman","year":"2023","unstructured":"Aman, B., & Ciobanu, G. (2023). Relating randomized right-hand sides to communicating rewriting rules. Theoretical Computer Science, 971, 114062. https:\/\/doi.org\/10.1016\/j.tcs.2023.114062","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"185_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.3217\/jucs-008-03-0369","volume":"8","author":"F Arroyo","year":"2002","unstructured":"Arroyo, F., Baranda, A. V., Castellanos, J., & P\u0103un, G. (2002). Membrane computing: The power of (rule) creation. Journal of Universal Computer Science, 8(3), 369\u2013381. https:\/\/doi.org\/10.3217\/jucs-008-03-0369","journal-title":"Journal of Universal Computer Science"},{"key":"185_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-31837-8_13","volume-title":"Membrane Computing. Lecture Notes in Computer Science","author":"M Cavaliere","year":"2005","unstructured":"Cavaliere, M., Ionescu, M., & Ishdorj, T. O. (2005). Inhibiting\/de-inhibiting rules in P systems. In G. Mauri, G. P\u0103un, M. J. P\u00e9rez-Jim\u00e9nez, G. Rozenberg, & A. Salomaa (Eds.), Membrane Computing. Lecture Notes in Computer Science (Vol. 3365, pp. 224\u2013238). Berlin, Heidelberg: Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-31837-8_13"},{"key":"185_CR8","volume-title":"Grammar Systems: A Grammatical Approach to Distribution and Cooperation, Topics in Computer Mathematics","author":"E Csuhaj-Varj\u00fa","year":"1994","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Kelemen, J., & P\u0103un, G. (1994). Grammar Systems: A Grammatical Approach to Distribution and Cooperation, Topics in Computer Mathematics (Vol. 5). Gordon and Breach Science Publishers."},{"key":"185_CR9","doi-asserted-by":"publisher","unstructured":"Dassow, J., P\u0103un, G. & Rozenberg, G. (1997). Grammar systems. In A. Salomaa, & G. Rozenberg (eds.) Handbook of Formal Languages, (vol.\u00a02, chap.\u00a04, pp. 155\u2013213). Springer-Verlag, Berlin-Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-07675-0_4","DOI":"10.1007\/978-3-662-07675-0_4"},{"key":"185_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48321-7_23","volume-title":"Fundamentals of Computation Theory","author":"R Freund","year":"1999","unstructured":"Freund, R. (1999). Generalized P-systems. In G. Ciobanu & G. P\u0103un (Eds.), Fundamentals of Computation Theory (pp. 281\u2013292). Berlin, Heidelberg: Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/3-540-48321-7_23"},{"key":"185_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1142\/9789812810908_0019","volume-title":"Words, Semigroups, and Transductions","author":"M Ito","year":"2002","unstructured":"Ito, M., Mart\u00edn-Vide, C., & P\u0103un, G. (2002). A characterization of parikh sets of ET0L languages in terms of P systems. In M. Ito, G. P\u0103un, & S. Yu (Eds.), Words, Semigroups, and Transductions (pp. 239\u2013253). Singapore: World Scientifc. https:\/\/doi.org\/10.1142\/9789812810908_0019"},{"key":"185_CR12","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-14370-5_16","volume-title":"Membrane Computing. Lecture Notes in Computer Science","author":"S Ivanov","year":"2014","unstructured":"Ivanov, S. (2014). Polymorphic P systems with non-cooperative rules and no ingredients. In M. Gheorghe, G. Rozenberg, A. Salomaa, P. Sos\u00edk, & C. Zandron (Eds.), Membrane Computing. Lecture Notes in Computer Science (Vol. 8961, pp. 258\u2013273). Cham: Springer International Publishing. https:\/\/doi.org\/10.1007\/978-3-319-14370-5_16"},{"key":"185_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s41965-024-00145-0","volume":"6","author":"A Kuczik","year":"2024","unstructured":"Kuczik, A., & Vaszil, G. (2024). Simple variants of non-cooperative polymorphic P systems. Journal of Membrane Computing, 6, 179\u2013192. https:\/\/doi.org\/10.1007\/s41965-024-00145-0","journal-title":"Journal of Membrane Computing"},{"issue":"3","key":"185_CR14","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","volume":"18","author":"A Lindenmayer","year":"1968","unstructured":"Lindenmayer, A. (1968). Mathematical models for cellular interactions in development I.\u00a0Filaments with one-sided inputs. Journal of Theoretical Biology, 18(3), 280\u2013299. https:\/\/doi.org\/10.1016\/0022-5193(68)90079-9","journal-title":"Journal of Theoretical Biology"},{"key":"185_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-58117-5_25","volume-title":"Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology","author":"G P\u0103un","year":"1992","unstructured":"P\u0103un, G. (1992). Parallel communicating systems of L systems. In G. Rozenberg & A. Salomaa (Eds.), Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology (pp. 405\u2013418). Springer Verlag. https:\/\/doi.org\/10.1007\/978-3-642-58117-5_25"},{"key":"185_CR16","first-page":"55","volume":"38","author":"G P\u0103un","year":"1989","unstructured":"P\u0103un, G., & S\u00e2ntean, L. (1989). Parallel communicating grammar systems: the regular case. Ann. Univ. Buc., Series Matem.-Inform., 38, 55\u201363.","journal-title":"Ann. Univ. Buc., Series Matem.-Inform."},{"key":"185_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/00207169008803876","volume":"34","author":"G P\u0103un","year":"1990","unstructured":"P\u0103un, G., & S\u00e2ntean, L. (1990). Further remarks on parallel communicating grammar systems. International Journal of Computer Mathematics, 34, 187\u2013203. https:\/\/doi.org\/10.1080\/00207169008803876","journal-title":"International Journal of Computer Mathematics"},{"issue":"1","key":"185_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108\u2013143. https:\/\/doi.org\/10.1006\/jcss.1999.1693","journal-title":"Journal of Computer and System Sciences"},{"key":"185_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un, G. (2002). Membrane Computing: An Introduction. Berlin, Heidelberg: Springer-Verlag. https:\/\/doi.org\/10.1007\/978-3-642-56196-2"},{"key":"185_CR20","doi-asserted-by":"publisher","unstructured":"P\u0103un, G., Rozenberg, G. & Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010). https:\/\/doi.org\/10.1093\/oso\/9780199556670.001.0001","DOI":"10.1093\/oso\/9780199556670.001.0001"},{"key":"185_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s41965-019-00007-0","volume":"1","author":"G Rom\u00e1n","year":"2019","unstructured":"Rom\u00e1n, G. (2019). Inference of bounded L systems with polymorphic P systems. Journal of Membrane Computing, 1, 52\u201357. https:\/\/doi.org\/10.1007\/s41965-019-00007-0","journal-title":"Journal of Membrane Computing"},{"key":"185_CR22","doi-asserted-by":"publisher","unstructured":"Rozenberg, G. & Salomaa, A. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5","DOI":"10.1007\/978-3-642-59136-5"},{"key":"185_CR23","doi-asserted-by":"publisher","unstructured":"Rozenberg, G. & Salomaa, A. Lindenmayer systems: impacts on theoretical computer science, computer graphics, and developmental biology. Springer Science and Business Media, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-3-642-58117-5","DOI":"10.1007\/978-3-642-58117-5"},{"issue":"3","key":"185_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1009999616642","volume":"1","author":"G Vaszil","year":"1999","unstructured":"Vaszil, G. (1999). Communication in parallel communicating Lindenmayer systems. Grammars, 1(3), 255\u2013270. https:\/\/doi.org\/10.1023\/A:1009999616642","journal-title":"Grammars"},{"key":"185_CR25","first-page":"99","volume-title":"Grammatical Models of Multi-Agent Systems, Topics in Computer Mathematics,","author":"G Vaszil","year":"1999","unstructured":"Vaszil, G. (1999). On parallel communicating Lindenmayer systems. In G. P\u0103un & A. Salomaa (Eds.), Grammatical Models of Multi-Agent Systems, Topics in Computer Mathematics, (Vol. 8, pp. 99\u2013112). Gordon and Breach Science Publishers."},{"key":"185_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1201\/9780203009642.ch10","volume-title":"Grammars and Automata for String Processing From Mathematics and Computer Science to Biology, and Back","author":"G Vaszil","year":"2003","unstructured":"Vaszil, G. (2003). On the generative capacity of parallel communicating extended Lindenmayer systems. In C. Mart\u00edn-Vide & V. Mitrana (Eds.), Grammars and Automata for String Processing From Mathematics and Computer Science to Biology, and Back (pp. 99\u2013110). Taylor and Francis."}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00185-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41965-025-00185-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00185-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:29:28Z","timestamp":1759274968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41965-025-00185-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["185"],"URL":"https:\/\/doi.org\/10.1007\/s41965-025-00185-0","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"type":"print","value":"2523-8906"},{"type":"electronic","value":"2523-8914"}],"subject":[],"published":{"date-parts":[[2025,4,3]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}