On uniform recurrence of HD0l systems
  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. 
Ivan Mitrofanov
math.CO math.LO