Author： Franek F. Karaman A. Smyth W.F.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.249, Iss.2, 2000-10, pp. : 289-303
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
Weak repetitions in Sturmian strings
By Karaman A.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
On a combinatorial property of Sturmian words
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
By Chuan W.-F.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :
By de Luca A.
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
Palindromes and Sturmian words
Theoretical Computer Science, Vol. 223, Iss. 1, 1999-07 ,pp. :