{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:17:58Z","timestamp":1774271878663,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","award":["DAAD PPP 57724085"],"award-info":[{"award-number":["DAAD PPP 57724085"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Science and Technology, New Delhi, Government of India","award":["(DST\/IND\/DAAD\/P-01-2024(G)"],"award-info":[{"award-number":["(DST\/IND\/DAAD\/P-01-2024(G)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-026-00524-3","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:46:38Z","timestamp":1772520398000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Space separating special geffert normal form for succinct representation of star-controlled insertion-deletion systems"],"prefix":"10.1007","volume":"63","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"524_CR1","first-page":"1525","volume":"14","author":"S Marcus","year":"1969","unstructured":"Marcus, S.: Contextual grammars. Rev. Roumaine Math. Pures Appl. 14, 1525\u20131534 (1969)","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"524_CR2","doi-asserted-by":"publisher","unstructured":"P\u0103un, Gh.: Marcus Contextual Grammars, Studies in Linguistics and Philosophy, 67. Kluwer (1997). https:\/\/doi.org\/10.1007\/978-94-015-8969-7_4","DOI":"10.1007\/978-94-015-8969-7_4"},{"key":"524_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","author":"Gh P\u0103un","year":"1998","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer (1998). https:\/\/doi.org\/10.1007\/978-3-662-03563-4","journal-title":"DNA Computing: New Computing Paradigms. Springer"},{"key":"524_CR4","unstructured":"Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Ellis Horwood (1993)"},{"issue":"1","key":"524_CR5","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.: Insertion languages. Inf. Sci. 31(1), 77\u201389 (1983). https:\/\/doi.org\/10.1016\/0020-0255(83)90023-3","journal-title":"Inf. Sci."},{"key":"524_CR6","unstructured":"Kari, L.: On insertions and deletions in formal languages. Ph.D. thesis, University of Turku, Finland (1991)"},{"issue":"1","key":"524_CR7","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.: Contextual insertions\/deletions and computability. Inf. Comput. 131(1), 47\u201361 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0091","journal-title":"Inf. Comput."},{"key":"524_CR8","doi-asserted-by":"publisher","unstructured":"Kari, L., P\u0103un, Gh., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. In: Discrete Mathematics and Theretical Computer Science, DIMACS, 48, 329\u2013338. AMS (1999). https:\/\/doi.org\/10.1090\/dimacs\/048\/23","DOI":"10.1090\/dimacs\/048\/23"},{"issue":"4","key":"524_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/B:NACO.0000006769.27984.23","volume":"2","author":"A Takahara","year":"2003","unstructured":"Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. Nat. Comput. 2(4), 321\u2013336 (2003). https:\/\/doi.org\/10.1023\/B:NACO.0000006769.27984.23","journal-title":"Nat. Comput."},{"key":"524_CR10","doi-asserted-by":"publisher","unstructured":"Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: I. McQuillan, G. Pighizzini (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS, EPTCS, 31, 88\u201398. Open Publishing Association (2010). https:\/\/doi.org\/10.4204\/EPTCS.31.11","DOI":"10.4204\/EPTCS.31.11"},{"key":"524_CR11","doi-asserted-by":"publisher","unstructured":"Ivanov, S., Verlan, S.: About one-sided one-symbol insertion-deletion P systems. In: A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg, A. Salomaa (eds.) Membrane Computing - 14th International Conference, CMC 2013, LNCS, 8340, 225\u2013237. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54239-8_16","DOI":"10.1007\/978-3-642-54239-8_16"},{"issue":"4","key":"524_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11047-021-09866-y","volume":"20","author":"H Fernau","year":"2021","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: On the generative capacity of matrix insertion-deletion systems of small sum-norm. Nat. Comput. 20(4), 671\u2013689 (2021). https:\/\/doi.org\/10.1007\/s11047-021-09866-y","journal-title":"Nat. Comput."},{"key":"524_CR13","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.: Matrix insertion-deletion systems. Theoret. Comput. Sci. 456, 80\u201388 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.002","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"524_CR14","first-page":"15","volume":"27","author":"A Alhazov","year":"2022","unstructured":"Alhazov, A., Freund, R., Ivanov, S., Verlan, S.: Regulated insertion-deletion systems. J. Autom. Lang. Comb. 27(1\u20133), 15\u201345 (2022)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"524_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00236-018-0312-2","volume":"56","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: On path-controlled insertion-deletion systems. Acta Informatica 56(1), 35\u201359 (2019b). https:\/\/doi.org\/10.1007\/s00236-018-0312-2","journal-title":"Acta Informatica"},{"key":"524_CR16","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: When stars control a grammar\u2019s work. In: Z. Gazdag, S. Iv\u00e1n, G. Kov\u00e1sznai (eds.) Proceedings of the 16th International Conference on Automata and Formal Languages, AFL, EPTCS, vol. 386, pp. 96\u2013111. Open Publishing Association (2023). DOI: 10.4204\/EPTCS.386.9","DOI":"10.4204\/EPTCS.386.0"},{"key":"524_CR17","doi-asserted-by":"crossref","unstructured":"Alhazov, A., Ivanov, S., Verlan, S.: A 15-year retrospective on insertion-deletion systems: Progress, evolution, and future directions. Computer Science Journal of Moldova 32(3(96)), 332\u2013371 (2024). http:\/\/www.math.md\/publications\/csjm\/issues\/v32-n3\/13980\/","DOI":"10.56415\/csjm.v32.18"},{"issue":"1\u20132","key":"524_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.3233\/FI-2017-1580","volume":"155","author":"S Ivanov","year":"2017","unstructured":"Ivanov, S., Verlan, S.: Universality and computational completeness of controlled leftist insertion-deletion systems. Fund. Inform. 155(1\u20132), 163\u2013185 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1580","journal-title":"Fund. Inform."},{"key":"524_CR19","doi-asserted-by":"publisher","unstructured":"Krishna, S.N., Rama, R.: Insertion-deletion P systems. In: N. Jonoska, N.C. Seeman (eds.) DNA Computing, 7th Int. Workshop on DNA-Based Computers, 2001, LNCS, 2340, 360\u2013370. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-48017-X_34","DOI":"10.1007\/3-540-48017-X_34"},{"key":"524_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","author":"Gh P\u0103un","year":"2002","unstructured":"P\u0103un, Gh.: Membrane Computing: An Introduction. Springer (2002). https:\/\/doi.org\/10.1007\/978-3-642-56196-2","journal-title":"Membrane Computing: An Introduction. Springer"},{"issue":"3","key":"524_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/S11047-019-09742-W","volume":"18","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. 18(3), 563\u2013577 (2019a). https:\/\/doi.org\/10.1007\/S11047-019-09742-W","journal-title":"Nat. Comput."},{"key":"524_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1051\/ita\/1991250504731","volume":"25","author":"V Geffert","year":"1991","unstructured":"Geffert, V.: Normal forms for phrase-structure grammars. RAIRO Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications 25, 473\u2013498 (1991). https:\/\/doi.org\/10.1051\/ita\/1991250504731","journal-title":"RAIRO Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"524_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054125440034","volume":"37","author":"H Fernau","year":"2026","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: On the power of star-controlled insertion-deletion systems 37, 1\u201330 (2026). https:\/\/doi.org\/10.1142\/S0129054125440034","journal-title":"On the power of star-controlled insertion-deletion systems"},{"key":"524_CR24","doi-asserted-by":"publisher","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Further results on insertion-deletion systems with one-sided contexts. In: C. Mart\u00edn-Vide, F. Otto, H. Fernau (eds.) Language & Automata Theory & Applications, LATA, LNCS, 5196, 333\u2013344. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_31","DOI":"10.1007\/978-3-540-88282-4_31"},{"key":"524_CR25","doi-asserted-by":"publisher","unstructured":"Matveevici, A., Rogozhin, Y., Verlan, S.: Insertion-deletion systems with one-sided contexts. In: Machines, Computations, and Universality, 5th International Conference, MCU, LNCS, 4664, 205\u2013217. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74593-8_18","DOI":"10.1007\/978-3-540-74593-8_18"},{"issue":"2","key":"524_CR26","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/J.TCS.2004.06.031","volume":"330","author":"M Margenstern","year":"2005","unstructured":"Margenstern, M., P\u0103un, Gh., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theoret. Comput. Sci. 330(2), 339\u2013348 (2005). https:\/\/doi.org\/10.1016\/J.TCS.2004.06.031","journal-title":"Theoret. Comput. Sci."},{"key":"524_CR27","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: One-sided insertion and deletion: Traditional and P systems case. In: E. Csuhaj-Varj\u00fa, R. Freund, M. Oswald, K. Salomaa (eds.) International Workshop on Computing with Biomolecules, 244, 53\u201364. \u00d6sterreichische Computer Gesellschaft OCG (2008). https:\/\/hal.archives-ouvertes.fr\/hal-01352396"},{"key":"524_CR28","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2017.01.019","volume":"682","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Theoret. Comput. Sci. 682, 100\u2013121 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.01.019","journal-title":"Theoret. Comput. Sci."},{"key":"524_CR29","doi-asserted-by":"publisher","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Succinct star-controlled insertion-deletion systems using space separating normal forms. In: E. Formenti, J. Durand-Lose (eds.) Machines, Computations, and Universality, 10th International Conference, MCU 2024, LNCS, 15270, 17\u201334. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-81202-6_2","DOI":"10.1007\/978-3-031-81202-6_2"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00524-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00524-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00524-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:39Z","timestamp":1774268739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00524-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["524"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00524-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"7 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"12"}}