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

DOI10.1051/ita:2008005zbMath1156.68043arXivmath/0611508OpenAlexW2145239891MaRDI QIDQ3549292

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

Publication date: 22 December 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0611508

zbMATH Keywords

infinite wordsbeta-expansionspalindromes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Radix representation; digital problems (11A63)

Related Items (1)

Repetitions in beta-integers

This page was built for publication: Palindromic complexity of infinite words associated with non-simple Parry numbers