Author： Litovsky I. Staiger L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.174, Iss.1, 1997-03, pp. : 1-21
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
Finite and infinite pseudorandom binary words
By Mauduit C.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Access to resources
Recommend
Determinization of transducers over finite and infinite words
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
By Esik Z.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
A defect theorem for bi-infinite words
By Karhumaki J. Manuch J. Plandowski W.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :