<bibliography>
 <citation type="article" key="AlloucheBousquet-Melou:1994">
  <author>J.-P. Allouche</author>
  <author>M. Bousquet-M&#233;lou</author>
  <year>1994</year>
  <title>Facteurs des suites de Rudin-Shapiro g&#233;n&#233;ralis&#233;es</title>
  <journal>Bull. Belg. Math. Soc.</journal>
  <volume>1</volume>
  <pages>145&#8211;164</pages>
 </citation>
 <citation type="article" key="AlloucheRampersadShallit:2009">
  <author>J.-P. Allouche</author>
  <author>N. Rampersad</author>
  <author>J. Shallit</author>
  <year>2009</year>
  <title>Periodicity, repetitions, and orbits of an automatic sequence</title>
  <journal>Theoret. Comput. Sci.</journal>
  <volume>410</volume>
  <pages>2795&#8211;2803</pages>
  <doi>10.1016/j.tcs.2009.02.006</doi>
 </citation>
 <citation type="book" key="AlloucheShallit:2003b">
  <author>J.-P. Allouche</author>
  <author>J. Shallit</author>
  <year>2003</year>
  <title>Automatic Sequences: Theory, Applications, Generalizations</title>
  <publisher>Cambridge University Press</publisher>
 </citation>
 <citation type="article" key="BugeaudKriegerShallit:2011">
  <author>Y. Bugeaud</author>
  <author>D. Krieger</author>
  <author>J. Shallit</author>
  <year>2011</year>
  <title>Morphic and automatic words: maximal blocks and Diophantine approximation</title>
  <journal>Acta Arithmetica</journal>
  <volume>149</volume>
  <pages>181&#8211;199</pages>
  <doi>10.4064/aa149-2-7</doi>
 </citation>
 <citation type="unpublished" key="CharlierRampersadShallit:2011">
  <author>E. Charlier</author>
  <author>N. Rampersad</author>
  <author>J. Shallit</author>
  <title>Enumeration and decidable properties of automatic sequences</title>
  <url>http://arxiv.org/abs/1102.3698</url>
  <note>Preprint. To appear, Proc. DLT 2011</note>
 </citation>
 <citation type="article" key="Cobham:1969">
  <author>A. Cobham</author>
  <year>1969</year>
  <title>On the base-dependence of sets of numbers recognizable by finite automata</title>
  <journal>Math. Systems Theory</journal>
  <volume>3</volume>
  <pages>186&#8211;192</pages>
  <doi>10.1007/BF01746527</doi>
 </citation>
 <citation type="article" key="Cobham:1972">
  <author>A. Cobham</author>
  <year>1972</year>
  <title>Uniform tag sequences</title>
  <journal>Math. Systems Theory</journal>
  <volume>6</volume>
  <pages>164&#8211;192</pages>
  <doi>10.1007/BF01706087</doi>
 </citation>
 <citation type="article" key="CurrieRampersad:2008">
  <author>J. D. Currie</author>
  <author>N. Rampersad</author>
  <year>2008</year>
  <title>For each &#945;&#62; 2 there is an infinite binary word with critical exponent &#945;</title>
  <journal>Elect. J. Combinatorics</journal>
  <volume>15</volume>
  <eid>\#N34</eid>
  <url>http://www.combinatorics.org/Volume_15/Abstracts/v15i1n34.html</url>
 </citation>
 <citation type="article" key="Krieger:2007">
  <author>D. Krieger</author>
  <year>2007</year>
  <title>On critical exponents in fixed points of non-erasing morphisms</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>376</volume>
  <pages>70&#8211;88</pages>
  <doi>10.1016/j.tcs.2007.01.020</doi>
 </citation>
 <citation type="phdthesis" key="Krieger:2008">
  <author>D. Krieger</author>
  <year>2008</year>
  <title>Critical exponents and stabilizers of infinite words</title>
  <school>University of Waterloo</school>
 </citation>
 <citation type="article" key="Krieger:2009">
  <author>D. Krieger</author>
  <year>2009</year>
  <title>On critical exponents in fixed points of k-uniform binary morphisms</title>
  <journal>RAIRO Info. Theor. Appl.</journal>
  <volume>43</volume>
  <pages>41&#8211;68</pages>
  <doi>10.1051/ita:2007042</doi>
 </citation>
 <citation type="article" key="KriegerShallit:2007">
  <author>D. Krieger</author>
  <author>J. Shallit</author>
  <year>2007</year>
  <title>Every real number greater than 1 is a critical exponent</title>
  <journal>Theoret. Comput. Sci.</journal>
  <volume>381</volume>
  <pages>177&#8211;182</pages>
  <doi>10.1016/j.tcs.2007.04.037</doi>
 </citation>
 <citation type="article" key="KunzeShyrThierrin:1981">
  <author>M. Kunze</author>
  <author>H. J. Shyr</author>
  <author>G. Thierrin</author>
  <year>1981</year>
  <title>h-bounded and semidiscrete languages</title>
  <journal>Info. Control</journal>
  <volume>51</volume>
  <pages>147&#8211;187</pages>
  <doi>10.1016/S0019-9958(81)90253-9</doi>
 </citation>
 <citation type="article" key="MignosiPirillo:1992">
  <author>F. Mignosi</author>
  <author>G. Pirillo</author>
  <year>1992</year>
  <title>Repetitions in the Fibonacci infinite word</title>
  <journal>RAIRO Info. Theor. Appl.</journal>
  <volume>26</volume>
  <pages>199&#8211;204</pages>
 </citation>
 <citation type="article" key="PaunSalomaa:1995">
  <author>G. Paun</author>
  <author>A. Salomaa</author>
  <year>1995</year>
  <title>Thin and slender languages</title>
  <journal>Discrete Appl. Math.</journal>
  <volume>61</volume>
  <pages>257&#8211;270</pages>
  <doi>10.1016/0166-218X(94)00014-5</doi>
 </citation>
 <citation type="article" key="Shallit:1994">
  <author>J. Shallit</author>
  <year>1994</year>
  <title>Numeration systems, linear recurrences, and regular sets</title>
  <journal>Inform. Comput.</journal>
  <volume>113</volume>
  <pages>331&#8211;347</pages>
  <doi>10.1006/inco.1994.1076</doi>
 </citation>
</bibliography>
