Complexity of infinite words associated withbeta-expansions

Author： Frougny Christiane   Masáková Zuzana   Pelantová Edita  

Publisher： Edp Sciences

E-ISSN： 1290-385x|38|2|163-185

ISSN： 0988-3754

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

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

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

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

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

Palindromic complexity of infinite words associatedwith non-simple Parry numbers

By Balková L'ubomíra   Masáková Zuzana  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 1, 2008-03 ,pp. : 145-163

Edp Sciences

Access to resources Recommend Favorite

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

By Blanchet-Sadri Francine   Chen Bob   Munteanu Sinziana  

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

Edp Sciences

Access to resources Recommend Favorite