{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:21Z","timestamp":1725518841463},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_28","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T04:07:12Z","timestamp":1363320432000},"page":"311-322","source":"Crossref","is-referenced-by-count":3,"title":["Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalle","family":"Saari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1016\/j.tcs.2009.02.006","volume":"410","author":"J.-P. Allouche","year":"2009","unstructured":"Allouche, J.-P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci.\u00a0410, 2795\u20132803 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J.-P. Allouche","year":"1992","unstructured":"Allouche, J.-P., Shallit, J.O.: The ring of k-regular sequences. Theoret. Comput. Sci.\u00a098, 163\u2013197 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.296","volume":"5","author":"A. \u010cern\u00fd","year":"2002","unstructured":"\u010cern\u00fd, A.: Lyndon factorization of generalized words of Thue. Discrete Math. & Theoret. Comput. Sci.\u00a05, 17\u201346 (2002)","journal-title":"Discrete Math. & Theoret. Comput. Sci."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-22321-1_15","volume-title":"Developments in Language Theory","author":"\u00c9. Charlier","year":"2011","unstructured":"Charlier, \u00c9., Rampersad, N., Shallit, J.: Enumeration and Decidable Properties of Automatic Sequences. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 165\u2013179. Springer, Heidelberg (2011)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Systems Theory\u00a06, 164\u2013192 (1972)","journal-title":"Math. Systems Theory"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F. Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discrete Math.\u00a0179, 89\u2013101 (1998)","journal-title":"Discrete Math."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1017\/S0143385799133947","volume":"19","author":"F. Durand","year":"1999","unstructured":"Durand, F., Host, B., Skau, C.: Substitution dynamical systems, bratteli diagrams, and dimension groups. Ergod. Theory & Dynam. Sys.\u00a019, 953\u2013993 (1999)","journal-title":"Ergod. Theory & Dynam. Sys."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.P. Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04, 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-31606-7_16","volume-title":"Implementation and Application of Automata","author":"D. Go\u010d","year":"2012","unstructured":"Go\u010d, D., Henshall, D., Shallit, J.: Automatic Theorem-Proving in Combinatorics on Words. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 180\u2013191. Springer, Heidelberg (2012)"},{"key":"28_CR11","unstructured":"Go\u010d, D., Schaeffer, L., Shallit, J.: The subword complexity of k-automatic sequences is k-synchronized (June 23, 2012) (preprint), http:\/\/arxiv.org\/abs\/1206.5352"},{"key":"28_CR12","first-page":"43","volume":"1","author":"A. Ido","year":"1997","unstructured":"Ido, A., Melan\u00e7on, G.: Lyndon factorization of the Thue-Morse word and its relatives. Discrete Math. & Theoret. Comput. Sci.\u00a01, 43\u201352 (1997)","journal-title":"Discrete Math. & Theoret. Comput. Sci."},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-60922-9_13","volume-title":"STACS 96","author":"G. Melan\u00e7on","year":"1996","unstructured":"Melan\u00e7on, G.: Lyndon Factorization of Infinite Words. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 147\u2013154. Springer, Heidelberg (1996)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Schaeffer, L., Shallit, J.: The critical exponent is computable for automatic sequences. Int. J. Found. Comput. Sci. (2012) (to appear)","DOI":"10.1142\/S0129054112400655"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(03)00100-2","volume":"307","author":"P. S\u00e9\u00e9bold","year":"2003","unstructured":"S\u00e9\u00e9bold, P.: Lyndon factorization of the Prouhet words. Theoret. Comput. Sci.\u00a0307, 179\u2013197 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The critical exponent is computable for automatic sequences. In: Ambroz, P., Holub, S., M\u00e1sakov\u00e1, Z. (eds.) Proceedings 8th International Conference Words 2011. Elect. Proc. Theor. Comput. Sci., vol.\u00a063, pp. 231\u2013239 (2011)","DOI":"10.4204\/EPTCS.63.29"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)90016-7","volume":"50","author":"R. Siromoney","year":"1994","unstructured":"Siromoney, R., Mathew, L., Dare, V., Subramanian, K.: Infinite Lyndon words. Inform. Process. Lett.\u00a050, 101\u2013104 (1994)","journal-title":"Inform. Process. Lett."}],"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-642-37064-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T09:17:20Z","timestamp":1644571040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}