{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:12:08Z","timestamp":1783815128844,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100019783","name":"Agen\u021bia Na\u021bional\u0103 pentru Cercetare \u0219i Dezvoltare","doi-asserted-by":"publisher","award":["20.80009.5007.22"],"award-info":[{"award-number":["20.80009.5007.22"]}],"id":[{"id":"10.13039\/100019783","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11047-024-09986-1","type":"journal-article","created":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T08:02:40Z","timestamp":1712822560000},"page":"159-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the spectrum between reaction systems and string rewriting"],"prefix":"10.1007","volume":"23","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,11]]},"reference":[{"key":"9986_CR1","doi-asserted-by":"publisher","unstructured":"Alhazov A, Aman B, Freund R, Ivanov S (2016a) Simulating R systems by P\u00a0systems. In: Leporati A, Rozenberg G, Salomaa A, Zandron C (eds) Membrane computing\u201417th international conference, CMC 2016, Milan, Italy, July 25\u201329, 2016, Revised selected papers. Lecture notes in computer science, vol 10105, pp 51\u201366. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-54072-6_4","DOI":"10.1007\/978-3-319-54072-6_4"},{"key":"9986_CR2","doi-asserted-by":"publisher","unstructured":"Alhazov A, Freund R, Verlan S (2016b) P systems working in maximal variants of the set derivation mode. In: Leporati A, Rozenberg G, Salomaa A, Zandron C (eds) Membrane computing\u201417th 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":"2\u20133","key":"9986_CR3","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. Fundam Informaticae 181(2\u20133):239\u2013271. https:\/\/doi.org\/10.3233\/FI-2021-2058","journal-title":"Fundam Informaticae"},{"key":"9986_CR4","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. Theor Comput Sci 920:95\u2013112. https:\/\/doi.org\/10.1016\/J.TCS.2022.03.007","journal-title":"Theor Comput Sci"},{"key":"9986_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114056","volume":"970","author":"A Alhazov","year":"2023","unstructured":"Alhazov A, Ferrari-Dominguez V, Freund R, Glade N, Ivanov S (2023) A P systems variant for reasoning about sequential controllability of Boolean networks. Theor Comput Sci 970:114056. https:\/\/doi.org\/10.1016\/j.tcs.2023.114056","journal-title":"Theor Comput Sci"},{"issue":"3\u20134","key":"9986_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3233\/FI-2014-1016","volume":"131","author":"S Azimi","year":"2014","unstructured":"Azimi S, Iancu B, Petre I (2014) Reaction system models for the heat shock response. Fundam Informaticae 131(3\u20134):299\u2013312. https:\/\/doi.org\/10.3233\/FI-2014-1016","journal-title":"Fundam Informaticae"},{"key":"9986_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2015.02.014","volume":"598","author":"S Azimi","year":"2015","unstructured":"Azimi S, Gratie C, Ivanov S, Petre I (2015) Dependency graphs and mass conservation in reaction systems. Theor Comput Sci 598:23\u201339. https:\/\/doi.org\/10.1016\/j.tcs.2015.02.014","journal-title":"Theor Comput Sci"},{"key":"9986_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2015.11.040","volume":"623","author":"S Azimi","year":"2016","unstructured":"Azimi S, Gratie C, Ivanov S, Manzoni L, Petre I, Porreca AE (2016) Complexity of model checking for reaction systems. Theor Comput Sci 623:103\u2013113. https:\/\/doi.org\/10.1016\/j.tcs.2015.11.040","journal-title":"Theor Comput Sci"},{"issue":"08","key":"9986_CR9","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S0129054117500368","volume":"28","author":"S Azimi","year":"2017","unstructured":"Azimi S, Panchal C, Mizera A, Petre I (2017) Multi-stability, limit cycles, and period-doubling bifurcation with reaction systems. Int J Found Comput Sci 28(08):1007\u20131020. https:\/\/doi.org\/10.1142\/S0129054117500368","journal-title":"Int J Found Comput Sci"},{"issue":"7","key":"9986_CR10","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1142\/S0129054111008842","volume":"22","author":"R Brijder","year":"2011","unstructured":"Brijder R, Ehrenfeucht A, Main MG, Rozenberg G (2011) A tour of reaction systems. Int J Found Comput Sci 22(7):1499\u20131517. https:\/\/doi.org\/10.1142\/S0129054111008842","journal-title":"Int J Found Comput Sci"},{"issue":"1","key":"9986_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/321203.321206","volume":"11","author":"J Cocke","year":"1964","unstructured":"Cocke J, Minsky M (1964) Universality of tag systems with P=2. J ACM 11(1):15\u201320","journal-title":"J ACM"},{"key":"9986_CR12","doi-asserted-by":"publisher","unstructured":"Csuhaj-Varj\u00fa E, Vaszil G (2002) P automata or purely communicating accepting P systems. In: Paun G, Rozenberg G, Salomaa A, Zandron C (eds) Membrane computing, international workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19\u201323, 2002, Revised Papers. Lecture notes in computer science, vol 2597, pp 219\u2013233. Springer, Berlin. https:\/\/doi.org\/10.1007\/3-540-36490-0_14","DOI":"10.1007\/3-540-36490-0_14"},{"key":"9986_CR13","doi-asserted-by":"crossref","unstructured":"Dassow J, P\u0103un G (1989) Regulated rewriting in formal language theory. Springer, Heidelberg. https:\/\/www.springer.com\/de\/book\/9783642749346","DOI":"10.1007\/978-3-642-74932-2"},{"key":"9986_CR14","doi-asserted-by":"publisher","unstructured":"Dennunzio A, Formenti E, Manzoni L (2015a) Reaction systems and extremal combinatorics properties. Theor Comput Sci 598:138\u2013149. https:\/\/doi.org\/10.1016\/J.TCS.2015.06.001","DOI":"10.1016\/J.TCS.2015.06.001"},{"key":"9986_CR15","doi-asserted-by":"publisher","unstructured":"Dennunzio A, Formenti E, Manzoni L, Porreca AE (2015b) Ancestors, descendants, and gardens of Eden in reaction systems. Theor Comput Sci 608:16\u201326. https:\/\/doi.org\/10.1016\/j.tcs.2015.05.046. From Computer Science to Biology and Back","DOI":"10.1016\/j.tcs.2015.05.046"},{"key":"9986_CR16","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ic.2019.03.006","volume":"267","author":"A Dennunzio","year":"2019","unstructured":"Dennunzio A, Formenti E, Manzoni L, Porreca AE (2019) Complexity of the dynamics of reaction systems. Inf Comput 267:96\u2013109. https:\/\/doi.org\/10.1016\/j.ic.2019.03.006","journal-title":"Inf Comput"},{"issue":"1\u20134","key":"9986_CR17","first-page":"263","volume":"75","author":"A Ehrenfeucht","year":"2007","unstructured":"Ehrenfeucht A, Rozenberg G (2007) Reaction systems. Fundam Informaticae 75(1\u20134):263\u2013280","journal-title":"Fundam Informaticae"},{"key":"9986_CR18","doi-asserted-by":"publisher","unstructured":"Freund R (2019) A general framework for sequential grammars with control mechanisms. In: Hospod\u00e1r M, Jir\u00e1skov\u00e1 G, Konstantinidis S (eds) Descriptional complexity of formal systems\u201421st IFIP WG 1.02 international conference, DCFS 2019, Ko\u0161ice, Slovakia, July 17\u201319, 2019, Proceedings. Lecture notes in computer science, vol 11612, pp 1\u201334. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-23247-4_1","DOI":"10.1007\/978-3-030-23247-4_1"},{"key":"9986_CR19","unstructured":"Freund R, Staiger L (2019) Turing machines with activations of transitions. In: Freund R, Holzer M, Sempere JM (eds) Eleventh workshop on non-classical models of automata and applications, NCMA 2019, Valencia, Spain, July 2\u20133, 2019. \u00d6sterreichische Computer Gesellschaft, Vienna, pp 79\u201391"},{"key":"9986_CR20","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, 8th international workshop, WMC 2007, Thessaloniki, Greece, June 25\u201328, 2007 Revised selected and invited papers. Lecture notes in computer science, vol. 4860, pp. 271\u2013284. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-77312-2_17","DOI":"10.1007\/978-3-540-77312-2_17"},{"key":"9986_CR21","unstructured":"Ivanov S (2015) On the power and universality of biologically-inspired models of computation. Ph.D. thesis, University of Paris-Est, France. https:\/\/tel.archives-ouvertes.fr\/tel-01272318"},{"issue":"4","key":"9986_CR22","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/S41965-020-00055-X","volume":"2","author":"S Ivanov","year":"2020","unstructured":"Ivanov S, Petre I (2020) Controllability of reaction systems. J Membr Comput 2(4):290\u2013302. https:\/\/doi.org\/10.1007\/S41965-020-00055-X","journal-title":"J Membr Comput"},{"issue":"1\u20132","key":"9986_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3233\/FI-2015-1203","volume":"138","author":"S Ivanov","year":"2015","unstructured":"Ivanov S, Verlan S (2015) Random context and semi-conditional insertion-deletion systems. Fundam Informaticae 138(1\u20132):127\u2013144. https:\/\/doi.org\/10.3233\/FI-2015-1203","journal-title":"Fundam Informaticae"},{"issue":"4","key":"9986_CR24","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/S11047-021-09861-3","volume":"20","author":"S Ivanov","year":"2021","unstructured":"Ivanov S, Verlan S (2021) Single semi-contextual insertion-deletion systems. Nat Comput 20(4):703\u2013712. https:\/\/doi.org\/10.1007\/S11047-021-09861-3","journal-title":"Nat Comput"},{"issue":"2","key":"9986_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","volume":"168","author":"I Korec","year":"1996","unstructured":"Korec I (1996) Small universal register machines. Theor Comput Sci 168(2):267\u2013301. https:\/\/doi.org\/10.1016\/S0304-3975(96)00080-1","journal-title":"Theor Comput Sci"},{"key":"9986_CR26","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 interaction in development. J Theor Biol 18:280\u2013315","journal-title":"J Theor Biol"},{"key":"9986_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44992-2_5","volume-title":"DNA computing","author":"M Margenstern","year":"2001","unstructured":"Margenstern M, Rogozhin Yu (2001) About time-varying distributed H systems. In: Condon A, Rozenberg G (eds) DNA computing. Springer, Berlin, pp 53\u201362"},{"key":"9986_CR28","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ins.2015.03.048","volume":"313","author":"A M\u0229ski","year":"2015","unstructured":"M\u0229ski A, Penczek W, Rozenberg G (2015) Model checking temporal properties of reaction systems. Inf Sci 313:22\u201342. https:\/\/doi.org\/10.1016\/j.ins.2015.03.048","journal-title":"Inf Sci"},{"key":"9986_CR29","doi-asserted-by":"publisher","first-page":"289","DOI":"10.3233\/FI-2017-1567","volume":"154","author":"A M\u0229ski","year":"2017","unstructured":"M\u0229ski A, Koutny M, Penczek W (2017) Verification of linear-time temporal properties for reaction systems with discrete concentrations. Fund Inform 154:289\u2013306. https:\/\/doi.org\/10.3233\/FI-2017-1567","journal-title":"Fund Inform"},{"key":"9986_CR30","unstructured":"M\u0229ski A, Koutny M, Penczek W (2019) Model checking for temporal-epistemic properties of distributed reaction systems. Technical report, School of Computing, University of Newcastle upon Tyne"},{"key":"9986_CR31","doi-asserted-by":"publisher","unstructured":"Okubo F, Kobayashi S, Yokomori T (2012a) On the properties of language classes defined by bounded reaction automata. Theor Comput Sci 454:206\u2013221. https:\/\/doi.org\/10.1016\/J.TCS.2012.03.024","DOI":"10.1016\/J.TCS.2012.03.024"},{"key":"9986_CR32","doi-asserted-by":"publisher","unstructured":"Okubo F, Kobayashi S, Yokomori T (2012b) Reaction automata. Theor Comput Sci 429:247\u2013257. https:\/\/doi.org\/10.1016\/j.tcs.2011.12.045. Magic in Science","DOI":"10.1016\/j.tcs.2011.12.045"},{"key":"9986_CR33","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (eds) (2010) The Oxford handbook of membrane computing. Oxford University Press, Oxford"},{"key":"9986_CR34","doi-asserted-by":"publisher","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vol 1\u20133. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-59136-5","DOI":"10.1007\/978-3-642-59136-5"},{"key":"9986_CR35","doi-asserted-by":"publisher","unstructured":"Salomaa A (2014) Minimal reaction systems defining subset functions. In: Calude CS, 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 436\u2013446. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-13350-8_32","DOI":"10.1007\/978-3-319-13350-8_32"},{"issue":"2","key":"9986_CR36","doi-asserted-by":"publisher","first-page":"247","DOI":"10.14232\/actacyb.22.2.2015.2","volume":"22","author":"A Salomaa","year":"2015","unstructured":"Salomaa A (2015) Two-step simulations of reaction systems by minimal ones. Acta Cybern 22(2):247\u2013257. https:\/\/doi.org\/10.14232\/actacyb.22.2.2015.2","journal-title":"Acta Cybern"},{"key":"9986_CR37","unstructured":"Verlan S (2010) Study of language-theoretic computational paradigms inspired by biology, Paris. Habilation thesis"},{"key":"9986_CR38","doi-asserted-by":"crossref","unstructured":"Wikipedia contributors (2023) L-system\u2014Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=L-system &oldid=1182891458. Online; Accessed 19-November-2023","DOI":"10.1515\/9783839458624-005"},{"issue":"1","key":"9986_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/S41965-021-00070-6","volume":"3","author":"T Yokomori","year":"2021","unstructured":"Yokomori T, Okubo F (2021) Theory of reaction automata: a survey. J Membr Comput 3(1):63\u201385. https:\/\/doi.org\/10.1007\/S41965-021-00070-6","journal-title":"J Membr Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-09986-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-024-09986-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-09986-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T19:07:35Z","timestamp":1722625655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-024-09986-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,11]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9986"],"URL":"https:\/\/doi.org\/10.1007\/s11047-024-09986-1","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,11]]},"assertion":[{"value":"21 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2024","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 declare no conflict of interest\u2014financial or non-financial\u2014during the preparation of this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interests"}}]}}