Combinatoire de mots récurrents de complexitén+2

DOI10.1051/ita:2007027zbMath1149.11013OpenAlexW2118953597MaRDI QIDQ3512597

Théodore Tapsoba, Idrissa Kaboré

Publication date: 21 July 2008

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

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_4_425_0

zbMATH Keywords

Sturmian word(block-)complexityquasi-Sturmianquasi-Sturmian by insertion

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (2)

Abelian combinatorics on words: a survey ⋮ Minimal Complexities for Infinite Words Written with d Letters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Frequencies of factors of Sturmian sequences
• Substitutions in dynamics, arithmetics and combinatorics
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Complexity and special factors
• The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
• Sturmian morphisms and Rauzy's rules
• On the complexity of infinite sequences
• Transcendence of numbers with a low complexity expansion
• Palindrome complexity.
• Palindromes and Sturmian words
• Sequences with minimal block growth II
• Minimal symbolic flows having minimal block growth
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: Combinatoire de mots récurrents de complexitén+2