12 citations · 17 across the 3 of their papers we have counts for
3 papers
math.CO2014
On uniform recurrence of morphic sequences
Ivan Mitrofanov
We describe a shorter algorithm for HD0L uniform recurrence problem
math.CO2011★ 5 cited
On uniform recurrence of HD0l systems
Ivan Mitrofanov
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 recen…
math.CO2011★ 12 cited
A proof for the decidability of HD0L ultimate periodicity
Ivan Mitrofanov
We give a proof for the decidability of the HD0L ultimate periodicity problem.