English

On Christoffel and standard words and their derivatives

Discrete Mathematics 2016-02-11 v1 Formal Languages and Automata Theory Combinatorics

Abstract

We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the aforementioned classes of words. In the case of Christoffel words, the morphisms involved map aa to ak+1ba^{k+1}b (resp.,~abkab^{k}) and bb to akba^{k}b (resp.,~abk+1ab^{k+1}) for a suitable k>0k>0. As long as derivatives are longer than one letter, higher-order derivatives are naturally obtained. We define the depth of a Christoffel or standard word as the smallest order for which the derivative is a single letter. We give several combinatorial and arithmetic descriptions of the depth, and (tight) lower and upper bounds for it.

Keywords

Cite

@article{arxiv.1602.03231,
  title  = {On Christoffel and standard words and their derivatives},
  author = {Alma D'Aniello and Aldo de Luca and Alessandro De Luca},
  journal= {arXiv preprint arXiv:1602.03231},
  year   = {2016}
}

Comments

28 pages. Final version, to appear in TCS