Author： Prieur C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.276, Iss.1, 2002-04, pp. : 445-447
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
How to decide continuity of rational functions on infinite words
By Prieur C.
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :
Access to resources
Recommend
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. :
A defect theorem for bi-infinite words
By Karhumaki J. Manuch J. Plandowski W.
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. :