Breadth-First Serialisation of Trees and Rational Languages - Equipe Mathématiques discrètes, codage et cryptographie Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Breadth-First Serialisation of Trees and Rational Languages

Résumé

We present here the notion of breadth-first signature and its relationship with numeration system theory. It is the serialisation into an infinite word of an ordered infinite tree of finite degree. We study which class of languages corresponds to which class of words and, more specifically, using a known construction from numeration system theory, we prove that the signature of rational languages are substitutive sequences.
Fichier principal
Vignette du fichier
1404.0798.pdf (694.8 Ko) Télécharger le fichier

Dates et versions

hal-01075825 , version 1 (20-10-2014)

Identifiants

Citer

Victor Marsault, Jacques Sakarovitch. Breadth-First Serialisation of Trees and Rational Languages. 2014. ⟨hal-01075825⟩
120 Consultations
44 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More