On Critical exponents in fixed points of k-uniform binary morphisms
RAIRO-Theor. Inf. Appl., 43 1 (2009) 41-68
Published online: 2007-12-20
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On square factors and critical factors of k-bonacci words on infinite alphabet
N. Ghareghani and P. SharifaniTheoretical Computer Science 865 34 (2021)
https://doi.org/10.1016/j.tcs.2021.02.027
Synchronizing delay for binary uniform morphisms
Karel Klouda and Kateřina MedkováTheoretical Computer Science 615 12 (2016)
https://doi.org/10.1016/j.tcs.2015.11.043
An algorithm for enumerating all infinite repetitions in a D0L-system
Karel Klouda and Štěpán StarostaJournal of Discrete Algorithms 33 130 (2015)
https://doi.org/10.1016/j.jda.2015.03.006
The Critical Exponent is Computable for Automatic Sequences
Jeffrey ShallitElectronic Proceedings in Theoretical Computer Science 63 231 (2011)
https://doi.org/10.4204/EPTCS.63.29
Periodicity, repetitions, and orbits of an automatic sequence
Jean-Paul Allouche, Narad Rampersad and Jeffrey ShallitTheoretical Computer Science 410 (30-32) 2795 (2009)
https://doi.org/10.1016/j.tcs.2009.02.006