Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation
Yann Bugeaud, Dalia Krieger, Jeffrey Shallit

TL;DR
This paper investigates the structure of maximal blocks in morphic and automatic words, establishing algebraic and rational limits for their ratios, and explores implications for the irrationality exponents of related numbers.
Contribution
It proves that the limsup of ratios of maximal block positions is algebraic for morphic words and rational for automatic words, linking combinatorial properties to number theory.
Findings
Limit ratios are algebraic for morphic words.
Limit ratios are rational for automatic words.
Irrationality exponents of certain automatic and morphic numbers are rational or algebraic.
Abstract
Let be a morphic word over a finite alphabet , and let be a nonempty subset of . We study the behavior of maximal blocks consisting only of letters from in , and prove the following: let denote the starting and ending positions, respectively, of the 'th maximal -block in . Then is algebraic if is morphic, and rational if is automatic. As a result, we show that the same conclusion holds if are the starting and ending positions of the 'th maximal zero block, and, more generally, of the 'th maximal -block, where is an arbitrary word. This enables us to draw conclusions about the irrationality exponent of automatic and morphic numbers. In particular, we show that the irrationality exponent of automatic (resp., morphic) numbers belonging to…
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 · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms
