Author： Ferenczi S. Kasa Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.218, Iss.1, 1999-04, pp. : 177-195
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
Non-stochastic infinite and finite sequences
By V'yugin V.V.
Theoretical Computer Science, Vol. 207, Iss. 2, 1998-11 ,pp. :
Access to resources
Recommend
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,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. :
Finite acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :