Author： de Luca A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.183, Iss.1, 1997-08, pp. : 45-82
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On a combinatorial property of Sturmian words
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
Access to resources
Recommend
By Chuan W.-F.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :
Palindromes and Sturmian words
Theoretical Computer Science, Vol. 223, Iss. 1, 1999-07 ,pp. :
Sturmian words, Lyndon words and trees
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
Sturmian words and words with a critical exponent
By Vandeth D.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :