Author： Chuan W.-F.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 273-285
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
By Blanchet-Sadri F. Luhmann D.K.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
Semiperiodic words and root-conjugacy
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Finite and infinite pseudorandom binary words
By Mauduit C.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Constant bounds on the moments of the height of binary search trees
By Robson J.M.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
On repetition-free binary words of minimal density
By Kolpakov R. Kucherov G. Tarannikov Y.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :