EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 (2025) RAIRO-Theor. Inf. Appl., 59 (2025) 7 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Article Number 7
Number of page(s) 16
DOI https://doi.org/10.1051/ita/2025009
Published online 29 August 2025
  1. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 1 (1912) 1–67. Reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, et al., editors. Universitetsforlaget, Oslo (1977) 413-477. [Google Scholar]
  2. A. Restivo and S. Salemi, Overlap-free words on two symbols, in Automata on Infinite Words, Vol. 192 of Lect. Notes in Comp. Sci., edited by M. Nivat and D. Perrin. Springer-Verlag (1984) 198–206. [Google Scholar]
  3. Y. Kobayashi, Enumeration of irreducible binary words. Discrete Appl. Math. 20 (1988) 221–232. [Google Scholar]
  4. A. Carpi, Overlap-free words and finite automata. Theoret. Comput. Sci. 115 (1993) 243–260. [Google Scholar]
  5. J. Cassaigne, Counting overlap-free binary words, in STACS 93, Proc. 10th Symp. Theoretical Aspects of Comp. Sci., Lect. Notes in Comp. Sci., Vol. 665, edited by P. Enjalbert, A. Finkel, and K. Wagner. Springer-Verlag (1993) 216–225. [Google Scholar]
  6. N. Guglielmi and V. Protasov, Exact computation of joint spectral characteristics of linear operators. Found. Comput. Math. 13 (2013) 37–97. [Google Scholar]
  7. R.M. Jungers, V.Y. Protasov and V.D. Blondel, Overlap-free words and spectra of matrices. Theoret. Comput. Sci. 410 (2009) 3670–3684. [Google Scholar]
  8. E. Fife, Binary sequences which contain no BBb. Trans. Amer. Math. Soc. 261 (1980) 115–136. [Google Scholar]
  9. N. Rampersad, Overlap-Free Words and Generalizations, PhD thesis. University of Waterloo (2007). [Google Scholar]
  10. J. Berstel, A rewriting of Fife’s theorem about overlap-free words, in Results and Trends in Theoretical Computer Science, Lect. Notes in Comp. Sci., Vol. 812, edited by J. Karhumäki, H. Maurer and G. Rozenberg. Springer-Verlag (1994) 19–29. [Google Scholar]
  11. J.-P. Allouche, J.D. Currie and J. Shallit, Extremal infinite overlap-free binary words. Electron. J. Combin. 5 (1998). #R27. [Google Scholar]
  12. J.-P. Allouche and J. Shallit, The ubiquitous Prouhet–Thue–Morse sequence, Sequences and their Applications, Proceedings of SETA ’98, edited by in C. Ding, T. Helleseth and H. Niederreiter. Springer-Verlag (1998) 1–16. [Google Scholar]
  13. J.D. Currie, The analog of overlap-freeness for the period-doubling sequence. J. Int. Seq. 26 (2023) 23.8.2 [Google Scholar]
  14. D. Damanik, Local symmetries in the period-doubling sequence. Discrete Appl. Math. 100 (2000) 115–121. [Google Scholar]
  15. J. Berstel, Fibonacci words – a survey, in The Book of L, edited by G. Rozenberg and A. Salomaa. Springer-Verlag (1986) 13–27. [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.