{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:19Z","timestamp":1759638079431},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_15","type":"book-chapter","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T03:58:48Z","timestamp":1310702328000},"page":"165-179","source":"Crossref","is-referenced-by-count":4,"title":["Enumeration and Decidable Properties of Automatic Sequences"],"prefix":"10.1007","author":[{"given":"\u00c9milie","family":"Charlier","sequence":"first","affiliation":[]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoret. Comput. Sci.\u00a0292, 9\u201331 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR2","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":"15_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":"15_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00090-2","volume":"307","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.O.: The ring of k-regular sequences, II. Theoret. Comput. Sci.\u00a0307, 3\u201329 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR5","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, Cambridge (2003)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1051\/ita:2001127","volume":"35","author":"J. Berstel","year":"2001","unstructured":"Berstel, J.: An exercise on Fibonacci representations. RAIRO Inform. Th\u00e9or. App.\u00a035, 491\u2013498 (2001)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"15_CR7","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Noncommutative Rational Series With Applications","author":"J. Berstel","year":"2011","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series With Applications. Encyclopedia of Mathematics and Its Applications, vol.\u00a0137. Cambridge University Press, Cambridge (2011)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1051\/ita:2006030","volume":"40","author":"S. Brown","year":"2006","unstructured":"Brown, S., Rampersad, N., Shallit, J., Vasiga, T.: Squares and overlaps in the Thue-Morse sequence and some variants. RAIRO Inform. Th\u00e9or. App.\u00a040, 473\u2013484 (2006)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(96)00260-5","volume":"181","author":"V. Bruy\u00e8re","year":"1997","unstructured":"Bruy\u00e8re, V., Hansel, G.: Bertrand numeration systems and recognizability. Theoret. Comput. Sci.\u00a0181, 17\u201343 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"#cr-split#-15_CR10.1","doi-asserted-by":"crossref","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);","DOI":"10.36045\/bbms\/1103408547"},{"key":"#cr-split#-15_CR10.2","unstructured":"Corrigendum, Bull. Belg. Math. Soc. 1, 577 (1994)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218196709004968","volume":"19","author":"A. Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alonzo, V.: On the repetitivity index of infinite words. Internat. J. Algebra Comput.\u00a019, 145\u2013158 (2009)","journal-title":"Internat. J. Algebra Comput."},{"key":"15_CR12","unstructured":"Carpi, A., D\u2019Alonzo, V.: On factors of synchronized sequences. Theor. Comput. Sci. (to appear 011)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1051\/ita:2001129","volume":"35","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., Maggi, C.: On synchronized sequences and their separators. RAIRO Inform. Th\u00e9or. App.\u00a035, 513\u2013524 (2001)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"15_CR14","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":"15_CR15","unstructured":"Currie, J.D.: Lexicographically least words in the orbit closure of the Rudin-Shapiro word (2010), http:\/\/arxiv.org\/pdf\/0905.4923"},{"key":"15_CR16","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":"15_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0304-3975(96)00239-3","volume":"172","author":"I. Fagnot","year":"1997","unstructured":"Fagnot, I.: Sur les facteurs des mots automatiques. Theoret. Comput. Sci.\u00a0172, 67\u201389 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR18","unstructured":"Frougny, C., Solomyak, B.: On representation of integers in linear numeration systems. In: Pollicott, M., Schmidt, K. (eds.) Ergodic Theory of \u2124 d Actions (Warwick, 1993\u20131994), London Mathematical Society Lecture Note Series, vol.\u00a0228, pp. 345\u2013368. Cambridge University Press, Cambridge (1996)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(97)83808-X","volume":"180","author":"E. Garel","year":"1997","unstructured":"Garel, E.: S\u00e9parateurs dans les mots infinis engendr\u00e9s par morphismes. Theoret. Comput. Sci.\u00a0180, 81\u2013113 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-14455-4_20","volume-title":"Developments in Language Theory","author":"V. Halava","year":"2010","unstructured":"Halava, V., Harju, T., K\u00e4rki, T., Rigo, M.: On the periodicity of morphic words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 209\u2013217. Springer, Heidelberg (2010)"},{"key":"15_CR21","doi-asserted-by":"publisher","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":"15_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2007.04.037","volume":"381","author":"D. Krieger","year":"2007","unstructured":"Krieger, D., Shallit, J.: Every real number greater than 1 is a critical exponent. Theoret. Comput. Sci.\u00a0381, 177\u2013182 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/LICS.2005.2","volume-title":"20th IEEE Symposium on Logic in Computer Science (LICS 2005)","author":"J. Leroux","year":"2005","unstructured":"Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagrams. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 147\u2013156. IEEE Press, Los Alamitos (2005)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"329","DOI":"10.24033\/bsmf.2283","volume":"124","author":"B. Moss\u00e9","year":"1996","unstructured":"Moss\u00e9, B.: Reconnaissabilit\u00e9 des substitutions et complexit\u00e9 des suites automatiques. Bull. Soc. Math. France\u00a0124, 329\u2013346 (1996)","journal-title":"Bull. Soc. Math. France"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1142\/S0129054109006966","volume":"20","author":"F. Nicolas","year":"2009","unstructured":"Nicolas, F., Pritykin, Y.: On uniformly recurrent morphic sequences. Internat. J. Found. Comp. Sci.\u00a020, 919\u2013940 (2009)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"15_CR26","unstructured":"Saari, K.: On the Frequency and Periodicity of Infinite Words. PhD thesis, University of Turku, Finland (2008)"},{"key":"15_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T09:26:10Z","timestamp":1592731570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}