Sequences close to periodic

DOI10.1070/RM2009v064n05ABEH004641zbMath1208.03017OpenAlexW2048562296MaRDI QIDQ3550936

Andrej A. Muchnik, A. L. Semenov, Yu. L. Pritykin

Publication date: 8 April 2010

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm2009v064n05abeh004641

zbMATH Keywords

automataKolmogorov complexitynormal numberssymbolic dynamicssurvey paperFibonacci sequenceThue-Morse sequencedecidability of logical theoriesSturmian sequenceToeplitz sequencesKolakoski sequencemorphic sequencealmost periodic sequencecomplexity of a sequencemonadic theoriestiling periodicitycombinatorial on words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other combinatorial number theory (11B75) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)

Related Items (10)

On almost periodicity of morphic sequences ⋮ Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ Specifying periodic words by restrictions ⋮ The Pascal automorphism has a continuous spectrum ⋮ The Thue-Morse-Pascal double sequence and similar structures ⋮ Automaton transformations and monadic theories of infinite sequences ⋮ Equivalence of right infinite words ⋮ On cogrowth function of algebras and its logarithmical gap ⋮ Criterion for substitutivity of Sturmian palindromes and one-dimensional factor dynamics ⋮ Periodicity of morphic words

This page was built for publication: Sequences close to periodic