Decidable properties of extension graphs for substitutive languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Decidable properties of extension graphs for substitutive languages

Abstract

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.
Fichier principal
Vignette du fichier
jm16.pdf (162.53 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03226869 , version 1 (15-05-2021)

Identifiers

  • HAL Id : hal-03226869 , version 1

Cite

Francesco Dolce, Revekka Kyriakoglou, Julien Leroy. Decidable properties of extension graphs for substitutive languages. 16èmes Journées Montoises d'informatique théorique, Sep 2016, Liege, Belgium. ⟨hal-03226869⟩
31 View
21 Download

Share

Gmail Mastodon Facebook X LinkedIn More