On uniform recurrence of HD0l systems

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.

20 pages, in Russian

Cited by in corpus (2)

• On uniform recurrence of morphic sequences
• Minimal number of restrictions defining a periodic word