Author： Karhumaki J. Manuch J. Plandowski W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 237-243
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
The P(n)/n-function for bi-infinite words
By Heinis A.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Access to resources
Recommend
Biinfinite words with maximal recurrent unbordered factors
By Costa J.C.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
Finite acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Finite and infinite pseudorandom binary words
By Mauduit C.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :