Author： Meidl W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 2045-2051
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 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. :
Access to resources
Recommend
Descriptive complexity of computable sequences
By Durand B. Shen A. Vereshchagin
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
The complexity of mean payoff games on graphs
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
Language complexity of rotations and Sturmian 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. :