{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:45:56Z","timestamp":1743104756797,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_16","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"192-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Matrix Ins-Del Systems of Small Sum-Norm"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]},{"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[]},{"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"16_CR1","series-title":"EATCS Monographs in Theoretical Computer Science","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, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-55911-7_15","volume-title":"Theory and Applications of Models of Computation","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Kuppusamy, L.: Parikh images of matrix ins-del systems. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 201\u2013215. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55911-7_15"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-60134-2_8","volume-title":"Implementation and Application of Automata","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Computational completeness of path-structured graph-controlled insertion-deletion systems. In: Carayol, A., Nicaud, C. (eds.) CIAA 2017. LNCS, vol. 10329, pp. 89\u2013100. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60134-2_8"},{"key":"16_CR4","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. Theor. Comput. Sci. 682, 100\u2013121 (2017). Special Issue on Languages and Combinatorics in Theory and Nature","journal-title":"Theor. Comput. Sci."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-92435-9_7","volume-title":"Unconventional Computation and Natural Computation","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Computational completeness of simple semi-conditional insertion-deletion systems. In: Stepney, S., Verlan, S. (eds.) UCNC 2018. LNCS, vol. 10867, pp. 86\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92435-9_7"},{"issue":"2","key":"16_CR6","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.: Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. 17(2), 249\u2013269 (2018)","journal-title":"Nat. Comput."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ita\/2018005","volume":"52","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. RAIRO Inf. th\u00e9or. et Appl.\/Theor. Inf. Appl. 52(1), 1\u201321 (2018)","journal-title":"RAIRO Inf. th\u00e9or. et Appl.\/Theor. Inf. Appl."},{"issue":"4","key":"16_CR8","first-page":"329","volume":"23","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Properties of language classes between linear and context-free. J. Autom. Lang. Combin. 23(4), 329\u2013360 (2018)","journal-title":"J. Autom. Lang. Combin."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4204\/EPTCS.31.11","volume":"31","author":"Rudolf Freund","year":"2010","unstructured":"Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS, vol. 31 of EPTCS, pp. 88\u201398 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"5\/6","key":"16_CR10","first-page":"303","volume":"27","author":"V Geffert","year":"1991","unstructured":"Geffert, V.: How to generate languages using only two pairs of parentheses. J. Inf. Process. Cybern. EIK 27(5\/6), 303\u2013315 (1991)","journal-title":"J. Inf. Process. Cybern. EIK"},{"issue":"1","key":"16_CR11","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)","journal-title":"Inf. Comput."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s11047-010-9208-y","volume":"10","author":"A Krassovitskiy","year":"2011","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10, 835\u2013852 (2011)","journal-title":"Nat. Comput."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1515\/amcs-2016-0017","volume":"26","author":"L Kuppusamy","year":"2016","unstructured":"Kuppusamy, L., Mahendran, A.: Modelling DNA and RNA secondary structures using matrix insertion-deletion systems. Int. J. Appl. Math. Comput. Sci. 26(1), 245\u2013258 (2016)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-662-03563-4"},{"key":"16_CR15","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. Theor. Comput. Sci. 456, 80\u201388 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1207\/s15516709cog2805_4","volume":"28","author":"E Stabler","year":"2004","unstructured":"Stabler, E.: Varieties of crossing dependencies: structure dependence and mild context sensitivity. Cogn. Sci. 28, 699\u2013720 (2004)","journal-title":"Cogn. Sci."},{"issue":"2","key":"16_CR17","first-page":"210","volume":"18","author":"S Verlan","year":"2010","unstructured":"Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210\u2013245 (2010)","journal-title":"Comput. Sci. J. Moldova"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:16:37Z","timestamp":1709810197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}