Author： Diamond P. Kloeden P. Kozyakin V. Pokrovskii A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.148, Iss.1, 1995-08, pp. : 1-17
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
Symbolic computation with sequences
By Petkovšek M.
Programming and Computer Software, Vol. 32, Iss. 2, 2006-03 ,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. :
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. :
Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences
By Meidl W.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :