{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:04:19Z","timestamp":1759334659913,"version":"build-2065373602"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Moldova State University","award":["Project 011301 \u201cInformation systems based on artificial intelligence\u201d"],"award-info":[{"award-number":["Project 011301 \u201cInformation systems based on artificial intelligence\u201d"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s41965-025-00198-9","type":"journal-article","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T15:52:23Z","timestamp":1753545143000},"page":"326-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An overview on simple P systems with specific variants of derivation modes"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6184-3971","authenticated-orcid":false,"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-1953","authenticated-orcid":false,"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6286-0917","authenticated-orcid":false,"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7800-1618","authenticated-orcid":false,"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"key":"198_CR1","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). Catalytic P systems with weak priority of catalytic rules. In: R.\u00a0Freund (ed.) Proceedings ICMC 2020, September 14\u201318, 2020, pp. 67\u201382. TU Wien."},{"key":"198_CR2","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2020). Computational completeness of catalytic P systems with weak priority of catalytic rules over non-cooperative rules. In: \u00a0Orellana-Mart\u00edn, D.,\u00a0P\u0103un, Gh., Riscos-N\u00fa\u00f1ez, A.,\u00a0P\u00e9rez-Hurtado, I. (eds.) Proceedings 18th Brainstorming Week on Membrane Computing, Sevilla, February 4\u20137, 2020, pp. 21\u201332. RGNC REPORT 1\/2020, Research Group on Natural Computing, Universidad de Sevilla."},{"issue":"3","key":"198_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/S41965-021-00079-X","volume":"3","author":"A Alhazov","year":"2021","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2021). When catalytic P systems with one catalyst can be computationally complete. Journal of Membrane Computing, 3(3), 170\u2013181. https:\/\/doi.org\/10.1007\/S41965-021-00079-X","journal-title":"Journal of Membrane Computing"},{"key":"198_CR4","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2023). Simple P systems with prescribed teams of sets of rules. In: Ciencialov\u00e1, L. (ed.) Proceedings of the 24th International Conference on Membrane Computing (CMC2023), August 28\u201331, 2023, Opava, Czech Republic, pp. 7\u201326. Silesian University, Opava."},{"key":"198_CR5","unstructured":"Alhazov, A., Freund, R., & Ivanov, S. (2025). Simple P systems with prescribed teams of sets of rules. https:\/\/archive.org\/details\/cmc-2023-prescribed-extended\/CMC2023_Prescribed_Extended.pdf."},{"key":"198_CR6","unstructured":"Alhazov, A., Freund, R., Ivanov, S., & Oswald, M. (2021). Variants of simple purely catalytic P systems with two catalysts. In: Vaszil, Gy., Zandron, C., Zhang, G. (eds.) International Conference on Membrane Computing ICMC 2021, Proceedings, pp. 39\u201353."},{"key":"198_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/J.TCS.2022.03.007","volume":"920","author":"A Alhazov","year":"2022","unstructured":"Alhazov, A., Freund, R., Ivanov, S., & Oswald, M. (2022). Variants of derivation modes for which purely catalytic P systems are computationally complete. Theoretical Computer Science, 920, 95\u2013112. https:\/\/doi.org\/10.1016\/J.TCS.2022.03.007","journal-title":"Theoretical Computer Science"},{"key":"198_CR8","unstructured":"Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2021). Variants of simple P systems with one catalyst being computationally complete. In: Vaszil, Gy., Zandron, C., Zhang, G. (eds.) International Conference on Membrane Computing ICMC 2021, Proceedings, pp. 21\u201338."},{"key":"198_CR9","doi-asserted-by":"publisher","unstructured":"Alhazov, A., Freund, R., Ivanov, S., & Verlan, S. (2022). Prescribed teams of rules working on several objects. In: Durand-Lose, J., Vaszil, Gy. (eds.) Machines, Computations, and Universality \u2013 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 \u2013 September\u00a02, 2022, Proceedings, Lecture Notes in Computer Science, vol. 13419, pp. 27\u201341. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-13502-6_6.","DOI":"10.1007\/978-3-031-13502-6_6"},{"key":"198_CR10","doi-asserted-by":"publisher","unstructured":"Alhazov, A., Freund, R., & Verlan, S. (2017). P systems working in maximal variants of the set derivation mode. In: Leporati, A., Rozenberg, G.,\u00a0Salomaa, A., Zandron, C. (eds.) Membrane Computing \u2013 17th International Conference, CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers, Lecture Notes in Computer Science, vol. 10105, pp. 83\u2013102. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-54072-6_6.","DOI":"10.1007\/978-3-319-54072-6_6"},{"issue":"4","key":"198_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s41965-019-00022-1","volume":"1","author":"B Aman","year":"2019","unstructured":"Aman, B., & Ciobanu, G. (2019). Synchronization of rules in membrane computing. Journal of Membrane Computing, 1(4), 233\u2013240. https:\/\/doi.org\/10.1007\/s41965-019-00022-1","journal-title":"Journal of Membrane Computing"},{"key":"198_CR12","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ins.2022.02.014","volume":"594","author":"B Aman","year":"2022","unstructured":"Aman, B., & Ciobanu, G. (2022). The power of synchronizing rules in membrane computing. Information Sciences, 594, 360\u2013370. https:\/\/doi.org\/10.1016\/j.ins.2022.02.014","journal-title":"Information Sciences"},{"key":"198_CR13","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., & Kelemen, J. (1994). Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Topics in computer mathematics. Gordon and Breach, 1400 Yverdon, Switzerland."},{"key":"198_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J Dassow","year":"1989","unstructured":"Dassow, J., & P\u0103un, Gh. (1989). Regulated Rewriting in Formal Language Theory. Berlin, Heidelberg: Springer."},{"key":"198_CR15","unstructured":"Freund, R. (2021). The power of parallelism in membrane computing. In: \u00a0Brejov\u00e1, B., Ciencialov\u00e1, L., Holena, M., Mr\u00e1z, F., Pardubsk\u00e1, D., Pl\u00e1tek, M., Vinar, T. (eds.) Proceedings of the 21st Conference Information Technologies \u2013 Applicationsand Theory (ITAT 2021), Hotel He\u013epa, N\u00edzke Tatry and Mur\u00e1nska planina, Slovakia, September 24\u201328, 2021, CEUR Workshop Proceedings, vol. 2962, pp. 1\u201316. CEUR-WS.org. https:\/\/ceur-ws.org\/Vol-2962\/invited01.pdf"},{"issue":"2","key":"198_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.06.029","volume":"330","author":"R Freund","year":"2005","unstructured":"Freund, R., Kari, L., Oswald, M., & Sos\u00edk, P. (2005). Computationally universal P systems without priorities: Two catalysts are sufficient. Theoretical Computer Science, 330(2), 251\u2013266. https:\/\/doi.org\/10.1016\/j.tcs.2004.06.029","journal-title":"Theoretical Computer Science"},{"key":"198_CR17","doi-asserted-by":"publisher","unstructured":"Freund, R., Leporati, A., Mauri, G., Porreca, A.E., Verlan, S., & Zandron, C. (2014). Flattening in (tissue) P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Yu., Rozenberg, G.,\u00a0Salomaa, A. (eds.) Membrane Computing, Lecture Notes in Computer Science, vol. 8340, pp. 173\u2013188. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-54239-8_13","DOI":"10.1007\/978-3-642-54239-8_13"},{"key":"198_CR18","doi-asserted-by":"publisher","unstructured":"Freund, R., & Verlan, S. (2007). A formal framework for static (tissue) P systems. In: Eleftherakis, G., Kefalas, P., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing, Lecture Notes in Computer Science, vol. 4860, pp. 271\u2013284. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-77312-2_17","DOI":"10.1007\/978-3-540-77312-2_17"},{"issue":"3\u20134","key":"198_CR19","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3233\/FI-2014-1025","volume":"131","author":"K Krithivasan","year":"2014","unstructured":"Krithivasan, K., P\u0103un, Gh., & Ramanujan, A. (2014). On controlled P systems. Fundamenta Informaticae, 131(3\u20134), 451\u2013464.","journal-title":"Fundamenta Informaticae"},{"key":"198_CR20","volume-title":"Computation","author":"ML Minsky","year":"1967","unstructured":"Minsky, M. L. (1967). Computation. Englewood Cliffs, NJ: Finite and Infinite Machines. Prentice Hall."},{"issue":"1","key":"198_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gh P\u0103un","year":"2000","unstructured":"P\u0103un, Gh. (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":"198_CR22","doi-asserted-by":"publisher","unstructured":"P\u0103un, Gh. (2002). Membrane Computing: An Introduction. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-56196-2.","DOI":"10.1007\/978-3-642-56196-2"},{"key":"198_CR23","unstructured":"P\u0103un, Gh., Rozenberg, G., & Salomaa, A. (eds.) (2010). The Oxford Handbook of Membrane Computing. Oxford University Press."},{"key":"198_CR24","doi-asserted-by":"publisher","unstructured":"Rozenberg, G., & Salomaa, A. (eds.) (1997). Handbook of Formal Languages. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-59136-5.","DOI":"10.1007\/978-3-642-59136-5"},{"key":"198_CR25","unstructured":"The P Systems Website. http:\/\/ppage.psystems.eu\/."}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00198-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41965-025-00198-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-025-00198-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:28:59Z","timestamp":1759274939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41965-025-00198-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,26]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s41965-025-00198-9","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"type":"print","value":"2523-8906"},{"type":"electronic","value":"2523-8914"}],"subject":[],"published":{"date-parts":[[2025,7,26]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}