Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 56, 2022
Article Number 5
Number of page(s) 13
DOI https://doi.org/10.1051/ita/2022007
Published online 20 May 2022
  1. J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, UK (2003). [CrossRef] [Google Scholar]
  2. J. Berstel, Mots de Fibonacci, L.I.T.P. Séminaire d'informatique Théorique, Paris (1980–1981), 57–78. [Google Scholar]
  3. J. Cassaigne, On extremal properties of the Fibonacci word. RAIRO-Theor. Inf. Appl. 42 (2008) 701–715. [CrossRef] [EDP Sciences] [Google Scholar]
  4. J. Cassaigne, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc. 4 (1997) 67–88. [Google Scholar]
  5. J. Cassaigne, An algorithm to test if a given circular HDOL-language avoids a pattern, in IFIP World Computer Congress'94, North-Holland (1994) 459–464. [Google Scholar]
  6. J. Cassaigne and I. Kaboré, Etude de la complexité du mot de Fibonacci géneralisé, in: Proceedings of 11th African Conference on Research in Computer Science and Applied Mathematics, CARI' 12 (2012) 62–69. [Google Scholar]
  7. J. Cassaigne and F. Nicolas, Complexity, in: Combinatorics, Automata and Number Theory, edited by V. Berthé and M. Rigo. Vol. 135 of Encyclopedia of Mathematics and its Applications. Cambridge University Press (2010). [Google Scholar]
  8. A. Ehrenfeucht, K.P. Lee and G. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interaction. Theoret. Comput. Sci. 1 (1975) 59–75. [CrossRef] [MathSciNet] [Google Scholar]
  9. A. de Luca, A combinatorial property of the Fibonacci words. Inform. Process. Lett. 12 (1981) 193–195. [CrossRef] [MathSciNet] [Google Scholar]
  10. M. Lothaire, Algebraic combinatorics on words. Cambridge University Press (2002). [CrossRef] [Google Scholar]
  11. F. Mignosi and G. Pirillo, Repetitions in the Fibonacci infinite word. RAIRO-Theor. Inf. Appl. 26 (1992) 199–204. [CrossRef] [EDP Sciences] [Google Scholar]
  12. G. Pirillo, From the Fibonacci word to Sturmian words. Publ. Math. Debrecen 54 (1999) 961–971. [MathSciNet] [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.