EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 55 (2021) RAIRO-Theor. Inf. Appl., 55 (2021) 3 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 55, 2021
Article Number 3
Number of page(s) 7
DOI https://doi.org/10.1051/ita/2021001
Published online 20 April 2021
  1. G. Badkobeh, Infinite words containing the minimal number of repetitions. J. Discrete Algorithms 20 (2013) 38–42. [Google Scholar]
  2. G. Badkobeh and M. Crochemore, Fewest repetitions in infinite binary words. RAIRO: ITA 46 (2012) 17–31. [Google Scholar]
  3. J. Berstel, Sur la construction de mots sans carré. Séminaire de Théorie des Nombres (1978–1979) 18.01–18.15. [Google Scholar]
  4. J. Berstel, Axel Thue’s Papers on Repetitions in Words: a Translation. Number 20 in Publications du Laboratoire de Combinatoire et d’Informatique Mathématique. Université du Québec à Montréal (1995). [Google Scholar]
  5. F. Blanchet-Sadri, J. Currie, N. Rampersad and N. Fox, Abelian complexity of fixed point of morphism 0↦012, 1↦02, 2↦1. INTEGERS: Elect. J. Combin. Number Theory 14 (2014) #A11 (electronic). [Google Scholar]
  6. É. Charlier, N. Rampersad and J. Shallit, Enumeration and decidable properties of automatic sequences. Internat. J. Found. Comp. Sci. 23 (2012) 1035–1066. [Google Scholar]
  7. A. Cobham, Uniform tag sequences. Math. Systems Theory 6 (1972) 164–192. [Google Scholar]
  8. R.C. Entringer, D.E. Jackson and J.A. Schatz, On nonrepetitive sequences. J. Combin. Theory Ser. A 16 (1974) 159–164. [Google Scholar]
  9. A.S. Fraenkel and J. Simpson, How many squares must a binary sequence contain ? Electronic J. Combinatorics 2 (1994) #R2. [Google Scholar]
  10. T. Harju and D. Nowotka, Binary words with few squares. Bull. European Assoc. Theor. Comput. Sci. 89 (2006) 164–166. [Google Scholar]
  11. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979). [Google Scholar]
  12. H. Mousavi, Automatic theorem proving in Walnut (2016). http://arxiv.org/abs/1603.06017. [Google Scholar]
  13. P. Ochem, A generator of morphisms for infinite words. RAIRO: ITA 40 (2006) 427–441. [Google Scholar]
  14. N. Rampersad, J. Shallit and M.-w. Wang, Avoiding large squares in infinite binary words. Theoret. Comput. Sci. 339 (2005) 19–34. [Google Scholar]
  15. A. Thue, Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7 (1906) 1–22. Reprinted in Selected Mathematical Papers of Axel Thue, edited by T. Nagell, Universitetsforlaget, Oslo (1977) 139–158. [Google Scholar]
  16. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1 (1912) 1–67. Reprinted in Selected Mathematical Papers of Axel Thue, edited by T. Nagell, Universitetsforlaget, Oslo (1977) 413–478. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.