Author： Chuan W.-f.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 337-344
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
Biinfinite words with maximal recurrent unbordered factors
By Costa J.C.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Merit factors and Morse sequences
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Computing the Betti numbers of arrangements via spectral sequences
By Basu S.
Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. :
Complexity for finite factors of infinite sequences
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Some properties of the factors of Sturmian sequences
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :