Smooth words over arbitrary alphabets

DOI10.1016/J.TCS.2005.04.010zbMath1077.68082OpenAlexW1997212136MaRDI QIDQ2566015

Philippe Choquette, Valérie Berthé, Srečko Brlek

Publication date: 22 September 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.04.010

zbMATH Keywords

Sturmian wordsFibonacci wordThue-Morse wordKolakoski wordRun-length encodingSmooth words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10)

Related Items (6)

Some properties of the Fibonacci sequence on an infinite alphabet ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ The sequence of return words of the Fibonacci sequence ⋮ Smooth words on 2-letter alphabets having same parity ⋮ The stable set of a self-map

Cites Work

• Combinatorial properties of smooth infinite words
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• On repeated factors in \(C^\infty\)-words
• Sturmian words: structure, combinatorics, and their arithmetics
• A note on differentiable palindromes.
• Enumeration of factors in the Thue-Morse word
• Sequences with minimal block growth
• Some properties of the singular words of the Fibonacci word
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smooth words over arbitrary alphabets