Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 365-385
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
Language complexity of rotations and Sturmian sequences
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
Limit values of the recurrence quotient of Sturmian sequences
By Cassaigne J.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Lyndon words and singular factors of sturmian words
By Melancon G.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Merit factors and Morse sequences
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Complexity for finite factors of infinite sequences
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :