Author： Heinis A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.273, Iss.1, 2002-02, pp. : 35-46
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
A defect theorem for bi-infinite words
By Karhumaki J. Manuch J. Plandowski W.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,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. :
Towards a language theory for infinite N-free pomsets
By Kuske D.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Words whose complexity satisfies limp(n)n=1
By Aberkane A.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :