A note on constructing infinite binary words with polynomial subword complexity∗

Author： Blanchet-Sadri Francine   Chen Bob   Munteanu Sinziana  

Publisher： Edp Sciences

E-ISSN： 1290-385x|47|2|195-199

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.47, Iss.2, 2013-05, pp. : 195-199

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Drunken man infinite words complexity

By Le Gonidec Marion  

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 3, 2008-06 ,pp. : 599-613

Edp Sciences

Access to resources Recommend Favorite

Fewest repetitions in infinite binary words

By Badkobeh Golnaz   Crochemore Maxime  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. : 17-31

Edp Sciences

Access to resources Recommend Favorite

Corrigendum: Complexity of infinite words associated withbeta-expansions

By Frougny Christiane   Masáková Zuzana   Pelantová Edita  

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 3, 2010-03 ,pp. : 269-271

Edp Sciences

Access to resources Recommend Favorite

Complexity of infinite words associated withbeta-expansions

By Frougny Christiane   Masáková Zuzana   Pelantová Edita  

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 2, 2010-03 ,pp. : 163-185

Edp Sciences

Access to resources Recommend Favorite

Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words

By Turek Ondřej  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 3, 2010-10 ,pp. : 313-337

Edp Sciences

Access to resources Recommend Favorite