{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:51:54Z","timestamp":1725850314836},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_18","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T16:45:50Z","timestamp":1456418750000},"page":"233-244","source":"Crossref","is-referenced-by-count":0,"title":["On Del-Robust Primitive Partial Words with One Hole"],"prefix":"10.1007","author":[{"given":"Ananda Chandra","family":"Nayak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit K.","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195768","volume-title":"Codes and Automata","author":"J Berstel","year":"2009","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, Cambridge (2009)"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2005.03.001","volume":"148","author":"F Blanchet-Sadri","year":"2005","unstructured":"Blanchet-Sadri, F.: Primitive partial words. Discrete Appl. Math. 148(3), 195\u2013213 (2005)","journal-title":"Discrete Appl. Math."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Primitive Partial Words. In: Algorithmic Combinatorics on Partial Words, p. 171. CRC Press, Boca Raton(2007)","DOI":"10.1201\/9781420060935"},{"key":"18_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/9781420060935","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F Blanchet-Sadri","year":"2007","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. CRC Press, Boca Raton (2007)"},{"issue":"3\/4","key":"18_CR5","first-page":"199","volume":"15","author":"F Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Cucuringu, M.: Counting primitive partial words. J. Automata Lang. Comb. 15(3\/4), 199\u2013227 (2010)","journal-title":"J. Automata Lang. Comb."},{"key":"18_CR6","unstructured":"Blanchet-Sadri, F., Nelson, S., Tebbe, A.: On operations preserving primitivity of partial words with one hole. In: AFL, pp. 93\u2013107 (2011)"},{"issue":"30","key":"18_CR7","doi-asserted-by":"publisher","first-page":"2910","DOI":"10.1016\/j.tcs.2009.01.024","volume":"410","author":"J Dassow","year":"2009","unstructured":"Dassow, J., Martin, G.M., Vico, F.J.: Some operations preserving primitivity of words. Theor. Comput. Sci. 410(30), 2910\u20132919 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR8","unstructured":"D\u00f6m\u00f6si, P., Horv\u00e1th, S., Ito, M.: On the connection between formal languages and primitive words. In: First Session on Scientific Communication, Univ. of Oradea, Oradea, Romania, pp. 59\u201367, June 1991"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-57163-9_15","volume-title":"Fundamentals of Computation Theory","author":"P D\u00f6m\u00f6si","year":"1993","unstructured":"D\u00f6m\u00f6si, P., Horv\u00e1th, S., Ito, M., K\u00e1szonyi, L., Katsura, M.: Formal languages consisting of primitive words. In: \u00c9sik, Z. (ed.) FCT 1993. LNCS, vol. 710, pp. 194\u2013203. Springer, Heidelberg (1993)"},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"18_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2003","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2003)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/11493785_20","volume-title":"DNA Computing","author":"P Leupold","year":"2005","unstructured":"Leupold, P.: Partial words for DNA coding. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 224\u2013234. Springer, Heidelberg (2005)"},{"issue":"1","key":"18_CR13","first-page":"5","volume":"3","author":"G Lischke","year":"2011","unstructured":"Lischke, G.: Primitive words and roots of words. Acta Univ. Sapientiae Informatica 3(1), 5\u201334 (2011)","journal-title":"Acta Univ. Sapientiae Informatica"},{"key":"18_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/978-3-319-15579-1_34","volume-title":"Language and Automata Theory and Applications","author":"AC Nayak","year":"2015","unstructured":"Nayak, A.C., Kapoor, K.: On the language of primitive partial words. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 436\u2013445. Springer, Heidelberg (2015)"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(00)00338-3","volume":"117","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un, G., Santean, N., Thierrin, G., Yu, S.: On the robustness of primitive words. Discrete Appl. Math. 117(1), 239\u2013252 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(95)00098-4","volume":"161","author":"H Petersen","year":"1996","unstructured":"Petersen, H.: On the language of primitive words. Theor. Comput. Sci. 161(1), 141\u2013156 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:29:24Z","timestamp":1559392164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}