Almost periodic sequences.

DOI10.1016/S0304-3975(02)00847-2zbMath1044.68100MaRDI QIDQ1401389

M. Ushakov, Andrej A. Muchnik, A. L. Semenov

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexity; Finite transducer; Almost periodic sequence; Finite automaton; Uniformly recurrent sequence

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Weakly contractive iterated function systems and beyond: a manual, Automata transformations of prefix decidable and decidable by Buchi superwords, Intermittent dispersal population model with almost period parameters and dispersal delays, Almost periodic transformable difference systems, Almost periodicity, finite automata mappings, and related effectiveness issues, Almost periodic sequence solutions of a discrete Lotka-Volterra competitive system with feedback control, Modularity in the semilattice of \(\omega \)-words, Finite-automaton transformations of strictly almost-periodic sequences, Positive almost periodic solution of discrete nonlinear survival red blood cells model with feedback control, Lower estimate of the regulator of the direct product of almost periodic and periodic sequences, DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES, Uniformly recurrent sequences and minimal Cantor omega-limit sets, Almost periodic homogeneous linear difference systems without almost periodic solutions, Population models in almost periodic environments, ON UNIFORMLY RECURRENT MORPHIC SEQUENCES

Cites Work

• On the valuedness of finite transducers
• Can an individual sequence of zeros and ones be random?
• Relations between varieties of kolmogorov complexities
• Generalized Morse sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item