Proof of a conjecture on word complexity

Bulletin of the Belgian Mathematical Society - Simon Stevin

Volumn 8, Issue 2, 2001, Pages 277-291

  Levé, Florence ^a   Séébold, Patrice ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039436460     PISSN: 13701444     EISSN: None     Source Type: Journal    
DOI: 10.36045/bbms/1102714173     Document Type: Article

References (7)

1. A. de Luca. On the combinatorics of finite words. Theoretical Computer Science, 218:13-39, 1999.
2. Z. Kása. On two conjectures on word complexity. In Second Joint Conference on Modern Mathematics, Ilieni, Rumania, page 44, June 3-7 1997.
3. Z. Kása. On the d-complexity of strings. Pure Mathematics and Applications, 9(1-2):119-128, 1998.
4. M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, Reading, Mass., 1983. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, Cambridge UK, 1997.
5. M. Lothaire. Algebraic Combinatorics on Words. Cambridge University Press, Cambridge UK, to appear in the Cambridge Mathematical Library.
6. A. Thue. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl., 7:1-22, 1906.
7. A. Thue. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl., 1:1-67, 1912.