English

Rhythmic generation of infinite trees and languages

Formal Languages and Automata Theory 2014-05-06 v2

Abstract

This work builds on the notion of breadth-first signature of infinite trees and (prefix-closed) languages introduced by the authors in a previous work. We focus here on periodic signatures, a case coming from the study of rational base numeration systems; the language of integer representations in base~pq\frac{p}{q} has a purely periodic signature whose period is derived from the Christoffel word of slope~pq\frac{p}{q}. Conversely, we characterise languages whose signature are purely periodic as representations of integers in such number systems with non-canonical alphabets of digits.

Keywords

Cite

@article{arxiv.1403.5190,
  title  = {Rhythmic generation of infinite trees and languages},
  author = {Victor Marsault and Jacques Sakarovitch},
  journal= {arXiv preprint arXiv:1403.5190},
  year   = {2014}
}

Comments

21 pages, early version

R2 v1 2026-06-22T03:30:54.711Z