2011/11/08 by Ivan Mitrofanov, Mitrofanov, Ivan · 1 citation
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #math.CO #math.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1111.1999
20 pages, in Russian
openalex publication_date 2011/11/08 · arxiv created 2012/07/17 · arxiv updated 2012/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.