Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation
| dc.creator | Bugeaud, Yann | |
| dc.creator | Krieger, Dalia | |
| dc.creator | Shallit, Jeffrey | |
| dc.date | 2008-08-19 | |
| dc.date | 2009-04-16 | |
| dc.date.accessioned | 2026-07-07T13:04:04Z | |
| dc.date.available | 2026-07-07T13:04:04Z | |
| dc.description | Let $\mb w$ 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 $\mb w$, and prove the following: let $(i_k,j_k)$ denote the starting and ending positions, respectively, of the $k$'th maximal $Δ$-block in $\mb w$. Then $\limsup_{k\to\infty} (j_k/i_k)$ is algebraic if $\mb w$ is morphic, and rational if $\mb w$ is automatic. As a result, we show that the same conclusion holds if $(i_k,j_k)$ are the starting and ending positions of the $k$'th maximal zero block, and, more generally, of the $k$'th maximal $x$-block, where $x$ 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 a certain class that we define is rational (resp., algebraic). | |
| dc.description | 16 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0808.2544 | |
| dc.identifier | http://arxiv.org/abs/0808.2544 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227027 | |
| dc.subject | Combinatorics | |
| dc.subject | Formal Languages and Automata Theory | |
| dc.subject | 68R15 | |
| dc.title | Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation | |
| dc.type | text |