{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:03:55Z","timestamp":1742994235190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_34","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"436-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Language of Primitive Partial Words"],"prefix":"10.1007","author":[{"given":"Ananda Chandra","family":"Nayak","sequence":"first","affiliation":[]},{"given":"Kalpesh","family":"Kapoor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"34_CR1","unstructured":"Aho, A.V., Hopcroft, J.E.: Design & Analysis of Computer Algorithms. Pearson Education India (1974)"},{"key":"34_CR2","unstructured":"Blanchet-Sadri, F., Zhang, J.: On the critical factorization theorem (preprint)"},{"issue":"3","key":"34_CR3","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 Applied Mathematics 148(3), 195\u2013213 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Algorithmic combinatorics on partial words. CRC Press (2007)","DOI":"10.1201\/9781420060935"},{"key":"34_CR5","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-78291-9_2","volume-title":"New Developments in Formal Languages and Applications","author":"F Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Open problems on partial words. In: Bel-Enguix, G., Dolores Jim\u00e9nez-L\u00f3pez, M., Mart\u00edn-Vide, C. (eds.) New Developments in Formal Languages and Applications. SCI, vol. 113, pp. 11\u201358. Springer, Heidelberg (2008)"},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.dam.2008.04.004","volume":"157","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Davis, C., Dodge, J., Merca\u015f, R., Moorefield, M.: Unbordered partial words. Discrete Applied Mathematics 157(5), 890\u2013900 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR7","first-page":"191","volume":"87","author":"P D\u00f6m\u00f6si","year":"2005","unstructured":"D\u00f6m\u00f6si, P., Horv\u00e1th, G.: The language of primitive words is not regular: two simple proofs. Bulletin of European Association for Theoretical Computer Science 87, 191\u2013194 (2005)","journal-title":"Bulletin of European Association for Theoretical Computer Science"},{"key":"34_CR8","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, Zolt\u00e1n (ed.) FCT 1993. LNCS, vol. 710, pp. 194\u2013203. Springer, Heidelberg (1993)"},{"issue":"21","key":"34_CR9","doi-asserted-by":"publisher","first-page":"4877","DOI":"10.1016\/j.disc.2007.09.006","volume":"308","author":"P D\u00f6m\u00f6si","year":"2008","unstructured":"D\u00f6m\u00f6si, P., Ito, M., Marcus, S.: Marcus contextual languages consisting of primitive words. Discrete Mathematics 308(21), 4877\u20134881 (2008)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/568438.568455","volume":"32","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. ACM SIGACT News 32(1), 60\u201365 (2001)","journal-title":"ACM SIGACT News"},{"key":"34_CR11","unstructured":"Horv\u00e1th, G., Nagy, B.: Pumping lemmas for linear and nonlinear context-free languages. arXiv preprint arXiv:1012.0023 (2010). http:\/\/arxiv.org\/abs\/1012.0023"},{"key":"34_CR12","unstructured":"Horv\u00e1th, S.: Strong interchangeability and nonlinearity of primitive words. In: Proc. Workshop AMAST Workshop on Algebraic Methods in Language Processing, vol. 95, pp. 173\u2013178 (1995)"},{"key":"34_CR13","unstructured":"Kunimochi, Y.: A context sensitive grammar generating the set of all primitive words. In: Algebras, Languages, Computations and their Applications, vol. 1562, pp. 143\u2013145 (2007)"},{"key":"34_CR14","first-page":"179","volume":"7","author":"P Leupold","year":"2004","unstructured":"Leupold, P.: Languages of partial words. Grammars 7, 179\u2013192 (2004)","journal-title":"Grammars"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-13089-2_34","volume-title":"Language and Automata Theory and Applications","author":"P Leupold","year":"2010","unstructured":"Leupold, P.: Primitive words are unavoidable for context-free languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 403\u2013413. Springer, Heidelberg (2010)"},{"key":"34_CR16","unstructured":"Lischke, G.: Primitive words and roots of words. arXiv preprint arXiv:1104.4427 (2011). http:\/\/arxiv.org\/abs\/1104.4427"},{"key":"34_CR17","unstructured":"Miller, G.A., Chomsky, N., Luce, D.R., Bush, R.R., Galanter, E.: Handbook of mathematical psychology (1963)"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/3-540-57785-8_181","volume-title":"STACS 94","author":"H Petersen","year":"1994","unstructured":"Petersen, H.: The ambiguity of primitive words. In: Enjalbert, P., Mayr, Ernst W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 679\u2013690. Springer, Heidelberg (1994)"},{"issue":"1","key":"34_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. Theoretical Computer Science 161(1), 141\u2013156 (1996)","journal-title":"Theoretical Computer Science"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A second course in formal languages and automata theory. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511808876"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:12:11Z","timestamp":1676009531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}