Formal Intercept of Sturmian words
Caius Wojcik
TL;DR
This paper introduces the concept of formal intercepts for Sturmian words, defining them via Ostrowski expansions, and explores their properties, factors graphs, and repetition functions to deepen understanding of Sturmian word structure.
Contribution
It provides a new combinatorial definition of the formal intercept of Sturmian words using Ostrowski expansions, expanding the theoretical framework.
Findings
Formal intercepts are characterized as infinite Ostrowski expansions.
Properties of Sturmian words are analyzed in relation to formal intercepts.
Factors graphs and repetition functions are studied in this context.
Abstract
We give a combinatorial definition of the second parameter describing Sturmian words, that we call formal intercept, as an infinite Ostrowski expansion. We recall the well-known properties of Sturmian words, study factors graphs and repetition function, and end with the definition of formal intercepts.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Natural Language Processing Techniques · Logic, programming, and type systems