Decidability of uniform recurrence of morphic sequences
classification
🧮 math.CO
cs.DM
keywords
sequencesmorphicrecurrencerecurrentuniformuniformlyboundedcorollary
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.