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

E-ISSN： 1290-385x|44|3|313-337

ISSN： 0988-3754

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

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

Palindromes in infinite ternary words

By Balková L'ubomíra Pelantová Edita Starosta Štěpán

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 4, 2009-09 ,pp. : 687-702

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

Existence of an infinite ternary 64-abelian square-free word

By Huova Mari

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 3, 2014-07 ,pp. : 307-314

Edp Sciences

Access to resources Recommend Favorite