On a Generalization of the Christoffel Tree: Epichristoffel Trees

Abhishek Krishnamoorthy
(Madras Christian College)
Robinson Thamburaj
(Madras Christian College)
Durairaj Gnanaraj Thomas
(Madras Christian College)

Sturmian words form a family of one-sided infinite words over a binary alphabet that are obtained as a discretization of a line with an irrational slope starting from the origin. A finite version of this class of words called Christoffel words has been extensively studied for their interesting properties. It is a class of words that has a geometric and an algebraic definition, making it an intriguing topic of study for many mathematicians. Recently, a generalization of Christoffel words for an alphabet with 3 letters or more, called epichristoffel words, using episturmian morphisms has been studied, and many of the properties of Christoffel words have been shown to carry over to epichristoffel words; however, many properties are not shared by them as well. In this paper, we introduce the notion of an epichristoffel tree, which proves to be a useful tool in determining a subclass of epichristoffel words that share an important property of Christoffel words, which is the ability to factorize an epichristoffel word as a product of smaller epichristoffel words. We also use the epichristoffel tree to present some interesting results that help to better understand epichristoffel words.

In Nelma Moreira and Luca Prigioniero: Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2025), Loughborough University, July 21-22, 2025, Electronic Proceedings in Theoretical Computer Science 422, pp. 15–28.
Published: 19th July 2025.

ArXived at: https://dx.doi.org/10.4204/EPTCS.422.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org