On uniform recurrence of HD0l systems
Combinatorics
2012-07-19 v3 Logic
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.
Cite
@article{arxiv.1111.1999,
title = {On uniform recurrence of HD0l systems},
author = {Ivan Mitrofanov},
journal= {arXiv preprint arXiv:1111.1999},
year = {2012}
}
Comments
20 pages, in Russian