4 papers
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…
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…
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…
Spectral instability of some non-selfadjoint anharmonic oscillators
Raphaël Henry
The purpose of this Note is to highlight the spectral instability of some non-selfadjoint differential operators, by studying the growth rate of the norms of the spectral projectio…