{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:02:30Z","timestamp":1726059750477},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030344993"},{"type":"electronic","value":"9783030345006"}],"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-34500-6_4","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:10:58Z","timestamp":1574381458000},"page":"70-81","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operation Insertion on the Conjugacy and Commutativity of Words"],"prefix":"10.1007","author":[{"given":"Kalpana","family":"Mahalingam","sequence":"first","affiliation":[]},{"given":"Hirapra","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(01)00278-X","volume":"289","author":"F Blanchet-Sadri","year":"2002","unstructured":"Blanchet-Sadri, F., Luhman, D.: Conjugacy on partial words. Theor. Comput. Sci. 289, 297\u2013312 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R Boyer","year":"1977","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Commun. ACM 20, 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-98654-8_18","volume-title":"Developments in Language Theory","author":"D-J Cho","year":"2018","unstructured":"Cho, D.-J., Han, Y.-S., Kim, H., Salomaa, K.: Site-directed deletion. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 219\u2013230. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98654-8_18"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-94631-3_5","volume-title":"Descriptional Complexity of Formal Systems","author":"D-J Cho","year":"2018","unstructured":"Cho, D.-J., Han, Y.-S., Salomaa, K., Smith, T.J.: Site-directed insertion: decision problems, maximality and minimality. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 49\u201361. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94631-3_5"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2017.03.040","volume":"701","author":"D Cho","year":"2017","unstructured":"Cho, D., Han, Y., Ng, T., Salomaa, K.: Outfix-guided insertion. Theor. Comput. Sci. 701, 70\u201384 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M Crochemore","year":"1991","unstructured":"Crochemore, M., Perrin, D.: Two-way string matching. J. Assoc. Comput. Mach. 38, 651\u2013675 (1991)","journal-title":"J. Assoc. Comput. Mach."},{"key":"4_CR7","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-48523-6_23","volume-title":"Automata, Languages and Programming","author":"M Crochemore","year":"1999","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 261\u2013270. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_23"},{"key":"4_CR9","volume-title":"Context-Free Languages and Primitive Words","author":"P D\u00f6m\u00f6si","year":"2005","unstructured":"D\u00f6m\u00f6si, P., Ito, M.: Context-Free Languages and Primitive Words. World Scientific, Singapore (2005)"},{"issue":"8","key":"4_CR10","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1080\/00207160410001715320","volume":"81","author":"HK Hsiao","year":"2004","unstructured":"Hsiao, H.K., Yeh, Y.T., Yu, S.S.: A note of Ins-primitive words. Int. J. Comput. Math. 81(8), 917\u2013929 (2004)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/00207160310001650016","volume":"81","author":"HK Hsiao","year":"2004","unstructured":"Hsiao, H.K., Yu, S.S., Zhao, Y.: Word-paired insertions of languages. Int. J. Comput. Math. 81(2), 169\u2013181 (2004)","journal-title":"Int. J. Comput. Math."},{"key":"4_CR12","unstructured":"Kari, L.: On insertion and deletion in formal languages, Ph.D. thesis, University of Turku (1991)"},{"key":"4_CR13","unstructured":"Kari, L., Mahalingam, K.: Insertion and deletion for involution codes. In: Proceedings of Conference of Algebraic Informatics, CAI, pp. 207\u2013219 (2005)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-77962-9_29","volume-title":"DNA Computing","author":"L Kari","year":"2008","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick conjugate and commutative words. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 273\u2013283. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77962-9_29"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation $$a^M=b^Nc^P$$ in a free group. Mich. Math. J. 9(4), 289\u2013298 (1962)","journal-title":"Mich. Math. J."},{"key":"4_CR16","unstructured":"Margaritis, D., Skiena, S.: Reconstructing strings from substrings in rounds. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 613\u2013620 (1995)"},{"key":"4_CR17","volume-title":"Data Compression: Methods and Theory","author":"JA Storer","year":"1998","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1998)"},{"key":"4_CR18","first-page":"112","volume-title":"Languages and Codes","author":"SS Yu","year":"2005","unstructured":"Yu, S.S.: Languages and Codes, pp. 112\u2013113. Tsang-Hai Co., Taichung (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34500-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:11:33Z","timestamp":1574381493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34500-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030344993","9783030345006"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34500-6_4","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":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kingston, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tpnc2019.irdta.eu\/","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":"38","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":"15","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":"2","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":"39% - 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":"2.1","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)"}}]}}