EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 (2025) RAIRO-Theor. Inf. Appl., 59 (2025) 18 References
Issue
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Generation, enumeration and tiling
Article Number 18
Number of page(s) 10
DOI https://doi.org/10.1051/ita/2025016
Published online 19 November 2025
  1. A. de Luca, On the combinatorics of finite words. Theor. Comput. Sci. 218 (1999) 13–39. [Google Scholar]
  2. F. D’Alessandro, A combinatorial problem on trapezoidal words. Theor. Comput. Sci. 273 (2002) 11–33. [Google Scholar]
  3. M. Bucci, A. De Luca and G. Fici, Enumeration and structure of trapezoidal words. Theor. Comput. Sci. 468 (2013) 12–22. [Google Scholar]
  4. W.-F. Chuan, Unbordered factors of the characteristic sequences of irrational numbers. Theor. Comput. Sci. 205 (1998) 337–344. [Google Scholar]
  5. T. Harju and D. Nowotka, Minimal Duval extensions. Int. J. Found. Comput. Sci. 15 (2004) 349–354. [Google Scholar]
  6. J. Berstel and A. de Luca, Sturmian words, Lyndon words and trees. Theor. Comput. Sci. 178 (1997) 171–203. [Google Scholar]
  7. J.-P. Borel and C. Reutenauer, On Christoffel classes. RAIRO Inform. Theor. Appl. 40 (2006) 15–27. [Google Scholar]
  8. W.-F. Chuan, Sturmian morphisms and α-words. Theor. Comput. Sci. 225 (1999) 129–148. [Google Scholar]
  9. S. Mantaci, A. Restivo and M. Sciortino, Burrows-Wheeler transform and Sturmian words. Inform. Process. Lett. 86 (2001) 241–246. [Google Scholar]
  10. S. Mantaci, A. Restivo, G. Romana, G. Rosone and M. Sciortino, A combinatorial view on string attractors. Theor. Comput. Sci. 850 (2021) 236–248. [Google Scholar]
  11. C. Reutenauer, From Christoffel Words to Markoff Numbers. Oxford University Press (2019). [Google Scholar]
  12. C. Reutenauer, Christoffel words and weak Markoff theory. Adv. Appl. Math. 127 (2021) 102179. [Google Scholar]
  13. D. Kempa, and N. Prezza, At the roots of dictionary compression: string attractors, in STOC 2018. ACM (2018) 827-840. [Google Scholar]
  14. N. Prezza, String attractors. CoRR, arXiv:709.05314 [abs] (2017). [Google Scholar]
  15. E.B. Christoffel, Observatio arithmetica. Ann. Mat. Pura Appl. 6 (1875) 145–152. [Google Scholar]
  16. A. de Luca and F. Mignosi, Some combinatorial properties of Sturmian words. Theor. Comput. Sci. 136 (1994) 361–385. [Google Scholar]
  17. A. Heinis, On low-complexity bi-infinite words and their factors. J. Theeor. Nombres Bordeaux 13 (2001) 421–442. [Google Scholar]
  18. F. Leve and P. Seebold, Proof of a conjecture on word complexity. Bull. Belg. Math. Soc. 8 (2001) 277-291. [Google Scholar]
  19. M.-C. Anisiu and J. Cassaigne, Properties of the complexity function for finite words. Rev. Anal. Numeer. Theeor. Approx. 33 (2004) 123–139. [Google Scholar]
  20. J. Berstel and C. Reutenauer, Noncommutative Series with Applications. Cambridge University Press (2011). [Google Scholar]
  21. J. Clough, and G. Myerson, Variety and multiplicity in diatonic systems. J. Music Theory 29 (1985) 249–270. [Google Scholar]
  22. G. Fici, A classification of trapezoidal words. Proceedings of 8th International Conference Words (2011). [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.