3 papers
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…
cs.DM2007
Finding the growth rate of a regular language in polynomial time
Dalia Krieger, Narad Rampersad, Jeffrey Shallit
We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a…