On uniform recurrence of morphic sequences
Ivan Mitrofanov
TL;DR
This paper presents a more efficient algorithm for determining the uniform recurrence of morphic sequences, advancing the computational methods in symbolic dynamics.
Contribution
It introduces a shorter, optimized algorithm for solving the HD0L uniform recurrence problem, improving upon previous approaches.
Findings
Algorithm is faster and more concise.
Successfully solves the uniform recurrence problem.
Applicable to a broader class of morphic sequences.
Abstract
We describe a shorter algorithm for HD0L uniform recurrence problem
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Mathematical Dynamics and Fractals