3 papers
cs.FL2026
The complexity of smooth words over binary alphabets
Julien Cassaigne, Raphaël Henry
Smooth words over an alphabet of non-negative integers are infinite words that are infinitely derivable, the emblematic example being the Oldenburger-Kolakoski word over…
math.DS2026
On the minimal components of substitution subshifts
Raphaël Henry
In this paper we study substitutions on where is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal b…
cs.DM2024
Morphic Sequences: Complexity and Decidability
Raphael Henry
In this work we recall Pansiot's result on the complexity of pure morphic sequences and we use the tools developed by Devyatov for morphic sequences to prove the decidability of th…