Author： Esik Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.273, Iss.1, 2002-02, pp. : 225-248
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 acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Access to resources
Recommend
Finite and infinite pseudorandom binary words
By Mauduit C.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Determinization of transducers over finite and infinite words
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
By Blanchet-Sadri F. Luhmann D.K.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :