2000 character limit reached
Decidability of uniform recurrence of morphic sequences
Published 24 Apr 2012 in math.CO and cs.DM | (1204.5393v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.