{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T21:16:54Z","timestamp":1765228614872,"version":"3.46.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Moldova State University.","award":["011301"],"award-info":[{"award-number":["011301"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11047-025-10019-8","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T17:30:03Z","timestamp":1754328603000},"page":"919-936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Prescribed teams of insertion and deletion rules working on different objects"],"prefix":"10.1007","volume":"24","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":[[2025,8,4]]},"reference":[{"issue":"1\u2014-2","key":"10019_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3233\/FI-2014-1088","volume":"134","author":"A Alhazov","year":"2014","unstructured":"Alhazov A, Freund R, Ivanov S (2014a) Length systems. Fundamenta Inform 134(1\u20132):17\u201337. https:\/\/doi.org\/10.3233\/FI-2014-1088","journal-title":"Fundamenta Inform"},{"key":"10019_CR7","doi-asserted-by":"publisher","unstructured":"Alhazov A, Aman B, Freund R (2014b) P systems with anti-matter. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sos\u00edk, P., Zandron, C. (eds.) Membrane computing\u201415th International Conference, CMC 2014, Prague, Czech Republic, August 20\u201322, 2014, Revised Selected Papers. Lecture Notes in Computer Science, vol. 8961, pp. 66\u201385. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-14370-5_5","DOI":"10.1007\/978-3-319-14370-5_5"},{"key":"10019_CR8","doi-asserted-by":"publisher","unstructured":"Alhazov A, Aman B, Freund R, P\u0103un Gh (2014c) Matter and anti-matter in membrane systems. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) Descriptional Complexity of Formal Systems\u201416th International Workshop, DCFS 2014, Turku, Finland, August 5\u20138, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8614, pp. 65\u201376. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-09704-6_7","DOI":"10.1007\/978-3-319-09704-6_7"},{"issue":"3","key":"10019_CR5","first-page":"304","volume":"23","author":"A Alhazov","year":"2015","unstructured":"Alhazov A, Freund R, Sos\u00edk P (2015) Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata. Comput Sci J Moldova 23(3):304\u2013328","journal-title":"Comput Sci J Moldova"},{"issue":"2\u20133","key":"10019_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.3233\/FI-2021-2058","volume":"181","author":"A Alhazov","year":"2021","unstructured":"Alhazov A, Freund R, Ivanov S, Oswald M (2021) Relations between control mechanisms for sequential grammars. Fund Inform 181(2\u20133):239\u2013271. https:\/\/doi.org\/10.3233\/FI-2021-2058","journal-title":"Fund Inform"},{"issue":"3 & 4","key":"10019_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1142\/S0129054122410015","volume":"33","author":"A Alhazov","year":"2022","unstructured":"Alhazov A, Freund R, Ivanov S, Verlan S (2022a) Tissue P systems with vesicles of multisets. Int J Found Comput Sci 33(3 & 4):179\u2013202. https:\/\/doi.org\/10.1142\/S0129054122410015","journal-title":"Int J Found Comput Sci"},{"issue":"1\u20133","key":"10019_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.25596\/JALC-2022-015","volume":"27","author":"A Alhazov","year":"2022","unstructured":"Alhazov A, Freund R, Ivanov S, Verlan S (2022b) Regulated insertion-deletion systems. J Automata Lang Combinat 27(1\u20133):15\u201345. https:\/\/doi.org\/10.25596\/JALC-2022-015","journal-title":"J Automata Lang Combinat"},{"key":"10019_CR9","doi-asserted-by":"publisher","unstructured":"Alhazov A, Freund R, Ivanov S, Verlan S (2022c) Prescribed teams of rules working on several objects. In: Durand-Lose, J., Vaszil, Gy. (eds.) Machines, Computations, and Universality\u20149th International Conference, MCU 2022, Debrecen, Hungary, August 31\u2013September 2, 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"},{"issue":"96","key":"10019_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.56415\/csjm.v32.18","volume":"32","author":"A Alhazov","year":"2024","unstructured":"Alhazov A, Ivanov S, Verlan S (2024) A 15-year retrospective on insertion-deletion systems: progress evolution and future directions. Comput Sci J Moldova 32(96):332\u2013371. https:\/\/doi.org\/10.56415\/csjm.v32.18","journal-title":"Comput Sci J Moldova"},{"key":"10019_CR10","unstructured":"Csuhaj-Varj\u00fa E, Dassow J, Kelemen J (1994) Grammar systems: a grammatical approach to distribution and cooperation. Topics Comput Math. Gordon and Breach, 1400 Yverdon, Switzerland"},{"key":"10019_CR11","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. Springer, Berlin"},{"key":"10019_CR14","doi-asserted-by":"publisher","unstructured":"Fernau H, Kuppusamy L, Verlan S (2017) Universal matrix insertion grammars with small size. In: Patitz, M.J., Stannett, M. (eds.) Unconventional Computation and Natural Computation\u201416th International Conference, UCNC 2017, Fayetteville, AR, USA, June 5\u20139, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10240, pp. 182\u2013193. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-58187-3_14","DOI":"10.1007\/978-3-319-58187-3_14"},{"issue":"2","key":"10019_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11047-017-9656-8","volume":"17","author":"H Fernau","year":"2018","unstructured":"Fernau H, Kuppusamy L, Raman I (2018) Investigations on the power of matrix insertion-deletion systems with small sizes. Nat Comput 17(2):249\u2013269. https:\/\/doi.org\/10.1007\/s11047-017-9656-8","journal-title":"Nat Comput"},{"key":"10019_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104688","volume":"284","author":"H Fernau","year":"2022","unstructured":"Fernau H, Kuppusamy L, Raman I (2022) On the computational completeness of matrix simple semi-conditional grammars. Inform Comput 284:104688. https:\/\/doi.org\/10.1016\/j.ic.2021.104688","journal-title":"Inform Comput"},{"key":"10019_CR17","doi-asserted-by":"publisher","unstructured":"Freund R, P\u0103un Gh (2014) P systems with anti-matter. In: Calude, C.S., Freivalds, R., Iwama, K. (eds.) Computing With New Resources\u2014Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. Lecture Notes in Computer Science, vol. 8808, pp. 409\u2013420. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-13350-8_30","DOI":"10.1007\/978-3-319-13350-8_30"},{"issue":"2","key":"10019_CR15","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. Theoret Comput Sci 330(2):251\u2013266. https:\/\/doi.org\/10.1016\/j.tcs.2004.06.029","journal-title":"Theoret Comput Sci"},{"key":"10019_CR18","doi-asserted-by":"publisher","unstructured":"Freund R, Rogozhin Yu, Verlan S (2012) P systems with minimal left and right insertion and deletion. In: Durand-Lose, J., Jonoska, N. (eds.) Unconventional computation and natural computation\u201411th International Conference, UCNC 2012, Orl\u00e9ans, France, September 3\u20137, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7445, pp. 82\u201393. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-32894-7_9","DOI":"10.1007\/978-3-642-32894-7_9"},{"issue":"1\u20132","key":"10019_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2015-1144","volume":"136","author":"R Freund","year":"2015","unstructured":"Freund R, Oswald M, P\u0103un Gh (2015) Catalytic and purely catalytic P systems and P automata: control mechanisms for obtaining computational completeness. Fund Inform 136(1\u20132):59\u201384. https:\/\/doi.org\/10.3233\/FI-2015-1144","journal-title":"Fund Inform"},{"issue":"1","key":"10019_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0255(83)90023-3","volume":"31","author":"D Haussler","year":"1983","unstructured":"Haussler D (1983) Insertion languages. Inf Sci 31(1):77\u201389. https:\/\/doi.org\/10.1016\/0020-0255(83)90023-3","journal-title":"Inf Sci"},{"key":"10019_CR22","unstructured":"Kari L. (1991) On insertion and deletion in formal languages. PhD thesis, University of Turku"},{"key":"10019_CR23","doi-asserted-by":"publisher","unstructured":"Kari L (1994) Power of controlled insertion and deletion. In: Karhum\u00e4ki, J., Maurer, H.A., Rozenberg, G. (eds.) Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10\u201311, 1994, Proceedings. Lecture Notes in Computer Science, vol. 812, pp. 197\u2013212. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-58131-6_48","DOI":"10.1007\/3-540-58131-6_48"},{"issue":"1","key":"10019_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"131","author":"L Kari","year":"1996","unstructured":"Kari L, Thierrin G (1996) Contextual insertions\/deletions and computability. Inf Comput 131(1):47\u201361. https:\/\/doi.org\/10.1006\/inco.1996.0091","journal-title":"Inf Comput"},{"issue":"4","key":"10019_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1080\/09528139508953816","volume":"7","author":"L Kari","year":"1995","unstructured":"Kari L, Mateescu A, P\u0103un Gh, Salomaa A (1995) Teams in cooperating grammar systems. J Exp Theor Artif Intell 7(4):347\u2013359. https:\/\/doi.org\/10.1080\/09528139508953816","journal-title":"J Exp Theor Artif Intell"},{"key":"10019_CR24","unstructured":"Kari L, P\u0103un Gh, Thierrin G, Yu S (1997) At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Proc. of 3rd DIMACS Workshop on DNA Based Computing, pp. 318\u2013333. Philadelphia, PA. https:\/\/api.semanticscholar.org\/CorpusID:29065605"},{"key":"10019_CR25","doi-asserted-by":"publisher","unstructured":"Margenstern M, Mitrana V, P\u00e9rez-Jim\u00e9nez MJ (2004) Accepting hybrid networks of evolutionary processors. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) 10th International Workshop on DNA Computing, Milan, Italy, June 7\u201310, 2004, Revised Selected Papers. Lecture Notes in Computer Science, vol. 3384, pp. 235\u2013246. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11493785_21","DOI":"10.1007\/11493785_21"},{"key":"10019_CR26","volume-title":"Computation. Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky ML (1967) Computation. Finite and Infinite Machines. Prentice Hall, Englewood Cliffs"},{"issue":"1","key":"10019_CR28","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. J Comput Syst Sci 61(1):108\u2013143. https:\/\/doi.org\/10.1006\/jcss.1999.1693","journal-title":"J Comput Syst Sci"},{"key":"10019_CR30","doi-asserted-by":"publisher","unstructured":"P\u0103un Gh (2002) Membrane computing: an introduction. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-56196-2","DOI":"10.1007\/978-3-642-56196-2"},{"volume-title":"The Oxford handbook of membrane computing","year":"2010","key":"10019_CR29","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (eds) (2010) The Oxford handbook of membrane computing. Oxford University Press, Oxford"},{"key":"10019_CR27","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2012.07.002","volume":"456","author":"I Petre","year":"2012","unstructured":"Petre I, Verlan S (2012) Matrix insertion-deletion systems. Theor Comput Sci 456:80\u201388. https:\/\/doi.org\/10.1016\/j.tcs.2012.07.002","journal-title":"Theor Comput Sci"},{"key":"10019_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of formal languages","year":"1997","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-59136-5"},{"issue":"2","key":"10019_CR32","first-page":"210","volume":"18","author":"S Verlan","year":"2010","unstructured":"Verlan S (2010) Recent developments on insertion-deletion systems. Comput Sci J Moldova 18(2):210\u2013245","journal-title":"Comput Sci J Moldova"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10019-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-025-10019-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10019-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T18:43:59Z","timestamp":1765219439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-025-10019-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10019"],"URL":"https:\/\/doi.org\/10.1007\/s11047-025-10019-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2025,8,4]]},"assertion":[{"value":"27 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose as well as no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}