On the number of Arnoux–Rauzy words

DOI10.4064/aa101-2-4zbMath1005.68117OpenAlexW1997949414MaRDI QIDQ2773325

Luca Q. Zamboni, Filippo Mignosi

Publication date: 21 February 2002

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa101-2-4

zbMATH Keywords

recurrent sequencesnumber of subwordsblock-complexitygeneralized Euler functionArnoux-Rauzy sequences\(k\)-letter alphabetfactors of Sturmian sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10) Automata sequences (11B85)

Related Items (8)

Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion ⋮ Episturmian words: a survey ⋮ Sturmian and Episturmian Words ⋮ Characterizations of finite and infinite episturmian words via lexicographic orderings ⋮ On the number of episturmian palindromes ⋮ Episturmian morphisms and a Galois theorem on continued fractions ⋮ A palindromization map on free monoids ⋮ On graphs of central episturmian words

This page was built for publication: On the number of Arnoux–Rauzy words