DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES
Fabien Durand · International Journal of Foundations of Computer Science · 2013
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.