On uniform recurrence of HD0l systems
classification
🧮 math.CO
math.LO
keywords
hd0lproblemdecidabilitydecidabledecidingdurandgivenmitrofanov
read the original abstract
We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.
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.