{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:41:23Z","timestamp":1648816883305},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00338-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T03:52:51Z","timestamp":1027569171000},"page":"239-252","source":"Crossref","is-referenced-by-count":8,"title":["On the robustness of primitive words"],"prefix":"10.1016","volume":"117","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolae","family":"Santean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Thierrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00338-3_BIB1","doi-asserted-by":"crossref","unstructured":"C. Choffrut, J. Karhumaki, Combinatorics on words, Handbook of Formal Languages, in Vol. 1, Springer, Berlin, 1997, pp. 329\u2013438 (Chapter 6).","DOI":"10.1007\/978-3-642-59136-5_6"},{"issue":"3\u20134","key":"10.1016\/S0166-218X(00)00338-3_BIB2","first-page":"315","article-title":"Formal languages and primitive words","volume":"42","author":"D\u00f6m\u00f6si","year":"1993","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/S0166-218X(00)00338-3_BIB3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02573680","article-title":"Right k-dense languages","volume":"48","author":"Ito","year":"1994","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0166-218X(00)00338-3_BIB4","first-page":"85","article-title":"Morphisms and primitivity","volume":"61","author":"P\u0103un","year":"1997","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/S0166-218X(00)00338-3_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(95)00098-4","article-title":"On the language of primitive words","volume":"161","author":"Petersen","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00338-3_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(89)90215-9","article-title":"Separating strings with small automata","volume":"30","author":"Robson","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00338-3_BIB7","series-title":"Handbook of Formal Languages, 3 Vols.","author":"Rozenberg","year":"1997"},{"key":"10.1016\/S0166-218X(00)00338-3_BIB8","series-title":"Free Monoids and Languages","author":"J. Shyr","year":"1991"},{"key":"10.1016\/S0166-218X(00)00338-3_BIB9","first-page":"535","article-title":"Non-primitive words in the language p+q+","volume":"20","author":"Shyr","year":"1994","journal-title":"Soochow J. Math."},{"issue":"4","key":"10.1016\/S0166-218X(00)00338-3_BIB10","first-page":"293","article-title":"Codes, languages and MOL schemes","volume":"1","author":"Shyr","year":"1977","journal-title":"RAIRO. Theor. Computer Sci."},{"key":"10.1016\/S0166-218X(00)00338-3_BIB11","unstructured":"M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, MA, 1983."},{"key":"10.1016\/S0166-218X(00)00338-3_BIB12","unstructured":"Y.S. Tai, H.L. Wu, Primitive properties of words in {uv,u}, Soochow J. Math. 20 (1994) 83\u2013100."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T19:50:55Z","timestamp":1557085855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X00003383"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00338-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}