Author： Currie James D. Saari Kalle
Publisher： Edp Sciences
E-ISSN： 1290-385x|43|1|165-178
ISSN： 0988-3754
Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.1, 2008-03, pp. : 165-178
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 generator of morphisms for infinite words
By Ochem Pascal
RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 3, 2006-10 ,pp. :
Access to resources
Recommend
Asymptotic behaviour of bi-infinite words
By Foryś Wit
RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 1, 2010-03 ,pp. :
Fewest repetitions in infinite binary words
By Badkobeh Golnaz Crochemore Maxime
RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. :
Drunken man infinite words complexity
RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 3, 2008-06 ,pp. :