Breadth-first serialisation of trees and rational languages

Victor Marsault, Jacques Sakarovitch

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment