Showing math.COShow all
2 papers · 1 filter
math.CO2008
Morphic and Automatic Words: Maximal Blocks and Diophantine Approximation
Yann Bugeaud, Dalia Krieger, Jeffrey Shallit
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 $\…
math.CO2008
The critical exponent of the Arshon words
Dalia Krieger
Generalizing the results of Thue (for n = 2) and of Klepinin and Sukhanov (for n = 3), we prove that for all n greater than or equal to 2, the critical exponent of the Arshon word…