Palindromic complexity of infinite words associatedwith non-simple Parry numbers

Author： Balková L'ubomíra   Masáková Zuzana  

Publisher： Edp Sciences

E-ISSN： 1290-385x|43|1|145-163

ISSN： 0988-3754

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

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

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

By Balková Lubomíra   Pelantová Edita   Turek Ondřej  

RAIRO - Theoretical Informatics and Applications, Vol. 41, Iss. 3, 2007-09 ,pp. : 307-328

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

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