DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES-Reference-Cited by-同舟云学术

DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES

Published:2013-01 Issue:01 Volume:24 Page:123-146
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

DURAND FABIEN¹

Affiliation:

1. Laboratoire Amiénois de Mathématiques Fondamentales et Appliquées, Université de Picardie Jules Verne, CNRS-UMR 7352, 33 rue Saint Leu, 80039 Amiens Cedex 01, France

Abstract

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054113500032

Reference27 articles.

1. An extension of Lagrange’s theorem to interval exchange transformations over quadratic fields

2. Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups

3. Logic and {$p$}-recognizable sets of integers

4. A characterization of the Morse minimal set up to topological conjugacy

5. The ω sequence problem for DOL systems is decidable

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decidable problems in substitution shifts;Journal of Computer and System Sciences;2024-08

2. A note on the base-p expansions of putative counterexamples to the p-adic Littlewood conjecture;Expositiones Mathematicae;2024-05

3. Bracket words: A generalisation of Sturmian words arising from generalised polynomials;Transactions of the American Mathematical Society;2023-04-19

4. Dimension Groups and Dynamical Systems;CAM ST AD M;2022-01-20

5. Morphic words and equidistributed sequences;Theoretical Computer Science;2020-01