Author： Blanchard F. Kurka P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 179-193
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
Some properties of the factors of Sturmian sequences
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,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. :
On the fragmentary complexity of symbolic sequences
By Diamond P. Kloeden P. Kozyakin V. Pokrovskii A.
Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. :
Descriptive complexity of computable sequences
By Durand B. Shen A. Vereshchagin
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
Complexity for finite factors of infinite sequences
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :