On sets of indefinitely desubstitutable words - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theoretical Computer Science Year : 2021

On sets of indefinitely desubstitutable words

Abstract

The stable set associated to a given set S of nonerasing endomorphisms or substitutions is the set of all right infinite words that can be indefinitely desubstituted over S. This notion generalizes the notion of sets of fixed points of morphisms. It is linked to S-adicity and to property preserving morphisms. Two main questions are considered. Which known sets of infinite words are stable sets? Which ones are stable sets of a finite set of substitutions? While bringing answers to the previous questions, some new characterizations of several well-known sets of words such as the set of binary balanced words or the set of episturmian words are presented. A characterization of the set of nonerasing endomorphisms that preserve episturmian words is also provided.
Fichier principal
Vignette du fichier
words_version_longue_pour_TCS.pdf (292.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-03005771 , version 1 (14-11-2020)

Identifiers

Cite

Gwenaël Richomme. On sets of indefinitely desubstitutable words. Theoretical Computer Science, 2021, 857, pp.97-113. ⟨10.1016/j.tcs.2021.01.004⟩. ⟨lirmm-03005771⟩
62 View
36 Download

Altmetric

Share

Gmail Facebook X LinkedIn More