Periodicity, repetitions, and orbits of an automatic sequence
From MaRDI portal
Publication:2271417
DOI10.1016/j.tcs.2009.02.006zbMath1173.68044OpenAlexW1592957478MaRDI QIDQ2271417
Narad Rampersad, Jeffrey O. Shallit, Jean-Paul Allouche
Publication date: 7 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.006
periodicityorbitdecidabilityThue-Morse sequencecontinued fractionautomatic sequenceorbit closuresquarefreeRudin-Shapiro sequenceoverlap-free
Combinatorics on words (68R15) Decidability (number-theoretic aspects) (11U05) Continued fractions (11A55) Automata sequences (11B85)
Related Items (24)
Abelian-square-rich words ⋮ How to prove that a sequence is not automatic ⋮ Hidden automatic sequences ⋮ Mechanical Proofs of Properties of the Tribonacci Word ⋮ On automatic infinite permutations ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ A New Approach to the Paperfolding Sequences ⋮ Unnamed Item ⋮ When is an automatic set an additive basis? ⋮ Deterministic functions on amenable semigroups and a generalization of the Kamae-Weiss theorem on normality preservation ⋮ Lexicographically least words in the orbit closure of the Rudin-Shapiro word ⋮ Extremal words in morphic subshifts ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ Univoque Numbers and Automatic Sequences ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Additive number theory via automata theory ⋮ The Critical Exponent is Computable for Automatic Sequences ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ Automatic congruences for diagonals of rational functions
Uses Software
Cites Work
- Extremal properties of (epi)Sturmian sequences and distribution modulo 1
- On the topological structure of univoque sets
- On critical exponents in fixed points of non-erasing morphisms
- Unique expansions of real numbers
- A characterization of power-free morphisms
- Sharp characterizations of squarefree morphisms
- Folded continued fractions
- Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
- Simple continued fractions for some irrational numbers
- Limit values of the recurrence quotient of Sturmian sequences
- \textit{Grail}: A C++ library for automata and expressions
- The index of Sturmian sequences
- Extremal infinite overlap-free binary words
- Subexpansions, superexpansions and uniqueness properties in non-integer bases
- Some properties of the factors of Sturmian sequences.
- On cube-free \(\omega\)-words generated by binary morphisms
- Non-integer bases, iteration of continuous real maps, and an arithmetic self-similar set
- Reversals and palindromes in continued fractions
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
- On Critical exponents in fixed points ofk-uniform binary morphisms
- Univoque numbers and an avatar of Thue–Morse
- A decision method for the recognizability of sets defined by number systems
- Unique Developments in Non-Integer Bases
- Automatic Sequences
- If a DOL language is k-power free then it is circular
- A property ofm-tuplings morse sequence
- Constructions of strictly ergodic systems
- Characterization of the unique expansions $1=\sum^{\infty}_{i=1}q^{-n_ i}$ and related problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Periodicity, repetitions, and orbits of an automatic sequence
