Smooth words over arbitrary alphabets

Authors:
Valérie Berthé;Srečko Brlek;Philippe Choquette
Affiliations:
LIRMM, Montpellier Cedex, France;LACIM, Département d'Informatique, Montréal, Que., Canada;Département de Mathématiques et statistiques, York University, Toronto, Ont., Canada
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 2

Systems of numeration and fractal functions relating to substitutions (French)

Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
On repeated factors in C∞ -words

Information Processing Letters
Some properties of the singular words of the Fibonacci word

European Journal of Combinatorics
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
A note on differentiable palindromes

Theoretical Computer Science

Smooth words on 2-letter alphabets having same parity

Theoretical Computer Science
The complexity of smooth words on 2-letter alphabets

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Smooth infinite words over ∑ = {1, 2} are connected to the Kolakoski word K = 221121 ..., defined as the fixpoint of the function Δ that counts the length of the runs of 1's and 2's. In this paper we extend the notion of smooth words to arbitrary alphabets and study some of their combinatorial properties. Using the run-length encoding Δ, every word is represented by a word obtained from the iterations of Δ. In particular we provide a new representation of the infinite Fibonacci word F as an eventually periodic word. On the other hand, the Thue-Morse word is represented by a finite one.