Decidable properties of extension graphs for substitutive languages
Résumé
Given a set of words S, one can associate with every word w ∈ S its extension graph which describes the possible left and right extensions of w in S. Families of sets can be defined from the properties of the extension graph of their elements: acyclic sets, tree sets, neutral sets, etc. In this paper we study the specific case of the set of factors of a substitutive language and we show that it is decidable whether these properties are verified or not.
Domaines
Théorie et langage formel [cs.FL]
Origine : Fichiers produits par l'(les) auteur(s)