{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:27:43Z","timestamp":1742970463000,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_16","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"180-191","source":"Crossref","is-referenced-by-count":12,"title":["Automatic Theorem-Proving in Combinatorics on Words"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dane","family":"Henshall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_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":"16_CR2","doi-asserted-by":"crossref","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"16_CR3","first-page":"1","volume-title":"Sequences and Their Applications, Proceedings of SETA 1998","author":"J.P. Allouche","year":"1999","unstructured":"Allouche, J.P., Shallit, J.O.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications, Proceedings of SETA 1998, pp. 1\u201316. Springer, Heidelberg (1999)"},{"key":"16_CR4","unstructured":"Berstel, J.: Axel Thue\u2019s Papers on Repetitions in Words: a Translation, vol.\u00a020. Publications du Laboratoire de Combinatoire et d\u2019Informatique Math\u00e9matique, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (February 1995)"},{"key":"16_CR5","first-page":"191","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belgian Math. Soc.\u00a01, 191\u2013238 (1994); Corrigendum, Bull. Belg. Math. Soc.\u00a01, 577 (1994)","journal-title":"Bull. Belgian Math. Soc."},{"key":"16_CR6","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":"16_CR7","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1016\/S0304-3975(02)00372-9","volume":"290","author":"J.C. Costa","year":"2003","unstructured":"Costa, J.C.: Biinfinite words with maximal recurrent unbordered factors. Theoret. Comput. Sci.\u00a0290, 2053\u20132061 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1051\/ita:2008006","volume":"43","author":"J.D. Currie","year":"2009","unstructured":"Currie, J.D., Saari, K.: Least periods of factors of infinite words. RAIRO Inform. Th\u00e9or. App.\u00a043, 165\u2013178 (2009)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BF03024244","volume":"4","author":"F.M. Dekking","year":"1982","unstructured":"Dekking, F.M., Mend\u00e8s France, M., van der Poorten, A.J.: Folds! Math. Intelligencer\u00a04, 130\u2013138, 173\u2013181, 190\u2013195 (1982), erratum\u00a0 5 (1983)","journal-title":"Intelligencer"},{"key":"16_CR10","first-page":"359","volume":"290","author":"J.P. Duval","year":"1980","unstructured":"Duval, J.P.: Une caract\u00e9risation de la p\u00e9riode d\u2019un mot fini par la longueur de ses facteurs primaires. C. R. Acad. Sci. Paris\u00a0290, A359\u2013A361 (1980)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(82)90186-8","volume":"40","author":"J.P. Duval","year":"1982","unstructured":"Duval, J.P.: Relationship between the period of a finite word and the length of its unbordered segments. Discrete Math.\u00a040, 31\u201344 (1982)","journal-title":"Discrete Math."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1016\/j.disc.2006.09.054","volume":"308","author":"J.P. Duval","year":"2008","unstructured":"Duval, J.P., Harju, T., Nowotka, D.: Unbordered factors and Lyndon words. Discrete Math.\u00a0308, 2261\u20132264 (2008)","journal-title":"Discrete Math."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.M.: Periodicity and unbordered segments of words. Discrete Math.\u00a026, 101\u2013109 (1979)","journal-title":"Discrete Math."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-63174-7_5","volume-title":"Automata Implementation","author":"J. Glenn","year":"1997","unstructured":"Glenn, J., Gasarch, W.I.: Implementing WS1S Via Finite Automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 50\u201363. Springer, Heidelberg (1997)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0031382","volume-title":"Automata Implementation","author":"J. Glenn","year":"1998","unstructured":"Glenn, J., Gasarch, W.I.: Implementing WS1S Via Finite Automata: Performance Issues. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol.\u00a01436, pp. 75\u201386. Springer, Heidelberg (1998)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1255443.1255448","volume":"54","author":"T. Harju","year":"2007","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words: a proof of the extended duval conjecture. J. Assoc. Comput. Mach.\u00a054, 1\u201320 (2007)","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2005.01.008","volume":"339","author":"S. Holub","year":"2005","unstructured":"Holub, S.: A proof of the extended Duval\u2019s conjecture. Theoret. Comput. Sci.\u00a0339, 61\u201367 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054110007465","volume":"21","author":"S. Holub","year":"2010","unstructured":"Holub, S., Nowotka, D.: On the relation between periodicity and unbordered factors of finite words. Internat. J. Found. Comp. Sci.\u00a021, 633\u2013645 (2010)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1986200403951","volume":"20","author":"J. Honkala","year":"1986","unstructured":"Honkala, J.: A decision method for the recognizability of sets defined by number systems. RAIRO Inform. Th\u00e9or. App.\u00a020, 395\u2013403 (1986)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"IT-19","author":"P.T. Nielsen","year":"1973","unstructured":"Nielsen, P.T.: A note on bifix-free sequences. IEEE Trans. Inform. Theory\u00a0IT-19, 704\u2013706 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(79)90135-3","volume":"28","author":"H. Prodinger","year":"1979","unstructured":"Prodinger, H., Urbanek, F.J.: Infinite 0\u20131-sequences without long adjacent identical blocks. Discrete Math.\u00a028, 277\u2013289 (1979)","journal-title":"Discrete Math."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ipl.2011.01.018","volume":"111","author":"N. Rampersad","year":"2011","unstructured":"Rampersad, N., Shallit, J., Wang, M.W.: Inverse star, borders, and palstars. Inform. Process. Lett.\u00a0111, 420\u2013422 (2011)","journal-title":"Inform. Process. Lett."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1090\/S0002-9939-1959-0116184-5","volume":"10","author":"W. Rudin","year":"1959","unstructured":"Rudin, W.: Some theorems on Fourier coefficients. Proc. Amer. Math. Soc.\u00a010, 855\u2013859 (1959)","journal-title":"Proc. Amer. Math. Soc."},{"key":"16_CR24","unstructured":"Saari, K.: On the Frequency and Periodicity of Infinite Words. Ph.D. thesis, University of Turku, Finland (2008)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The critical exponent is computable for automatic sequences. In: Ambro\u017e, P., Holub, S., Mas\u00e1kov\u00e1, Z. (eds.) WORDS 2011: 8th International Conference. Elect. Proc. Theor. Comput. Sci., pp. 231\u2013239 (2011), revised version, with L. Schaeffer, \n                      http:\/\/arxiv.org\/abs\/1104.2303v2","DOI":"10.4204\/EPTCS.63.29"},{"key":"16_CR26","unstructured":"Shapiro, H.S.: Extremal problems for polynomials and power series. Master\u2019s thesis, MIT (1952)"},{"key":"16_CR27","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a07, 1\u201322 (1906); reprinted in Nagell, T. (ed.) Selected Mathematical Papers of Axel Thue, pp.\u00a0139\u2013158. Universitetsforlaget, Oslo (1977)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"16_CR28","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a01, 1\u201367 (1912); reprinted in Nagell, T. (ed.) Selected Mathematical Papers of Axel Thue, pp.\u00a0413\u2013478. Universitetsforlaget, Oslo (1977)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T06:22:11Z","timestamp":1674109331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}