Palindromic complexity of infinite words associated with non-simple Parry numbers

Balková, L'ubomíra; Masáková, Zuzana

doi:10.1051/ita:2008005

Balková, L'ubomíra ; Masáková, Zuzana

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 1, pp. 145-163.

Voir la notice de l'article dans Numdam

Résumé

We study the palindromic complexity of infinite words $u_{β}$ , the fixed points of the substitution over a binary alphabet, $ϕ (0) = 0^{a} 1$ , $ϕ (1) = 0^{b} 1$ , with $a - 1 \geq b \geq 1$ , which are canonically associated with quadratic non-simple Parry numbers $β$ .

MR Zbl

DOI : 10.1051/ita:2008005

Classification : 68R15, 11A63
Mots-clés : palindromes, beta-expansions, infinite words

@article{ITA_2009__43_1_145_0,
     author = {Balkov\'a, L'ubom{\'\i}ra and Mas\'akov\'a, Zuzana},
     title = {Palindromic complexity of infinite words associated with non-simple {Parry} numbers},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {145--163},
     publisher = {EDP-Sciences},
     volume = {43},
     number = {1},
     year = {2009},
     doi = {10.1051/ita:2008005},
     zbl = {1156.68043},
     mrnumber = {2483448},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2008005/}
}

TY  - JOUR
AU  - Balková, L'ubomíra
AU  - Masáková, Zuzana
TI  - Palindromic complexity of infinite words associated with non-simple Parry numbers
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2009
SP  - 145
EP  - 163
VL  - 43
IS  - 1
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2008005/
DO  - 10.1051/ita:2008005
LA  - en
ID  - ITA_2009__43_1_145_0
ER  -

%0 Journal Article
%A Balková, L'ubomíra
%A Masáková, Zuzana
%T Palindromic complexity of infinite words associated with non-simple Parry numbers
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2009
%P 145-163
%V 43
%N 1
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2008005/
%R 10.1051/ita:2008005
%G en
%F ITA_2009__43_1_145_0

Balková, L'ubomíra; Masáková, Zuzana. Palindromic complexity of infinite words associated with non-simple Parry numbers. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 1, pp. 145-163. doi : 10.1051/ita:2008005. https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2008005/

Cité par Sources :