Combinatorial properties of smooth infinite words

DOI10.1016/j.tcs.2005.12.003zbMath1116.11014OpenAlexW2155195622MaRDI QIDQ818144

A. Ladouceur, Laurent Vuillon, Dulucq, Serge, Srečko Brlek

Publication date: 24 March 2006

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

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

zbMATH Keywords

combinatoricsfixed pointssubstitutionsKolakoski wordsmooth words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (6)

Automata and differentiable words ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Look and Say Fibonacci ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ Smooth words on 2-letter alphabets having same parity ⋮ Smooth words over arbitrary alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of \(C^{\infty}\)-words of each length
• 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
• Palindromes and Sturmian words
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: Combinatorial properties of smooth infinite words