Author： de Luca A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.218, Iss.1, 1999-04, pp. : 13-39
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
Sturmian words: structure, combinatorics, and their arithmetics
By de Luca A.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :
Access to resources
Recommend
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. :
Determinization of transducers over finite and infinite words
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :