Almost periodic sequences

Authors:
An. Muchnik;A. Semenov;M. Ushakov
Affiliations:
Institute of New Technologies Education, Nizhnaya Radishevskaya Street # 10, Moscow 109004, Russia;Institute of New Technologies Education, Nizhnaya Radishevskaya Street # 10, Moscow 109004, Russia;Institute of New Technologies Education, Nizhnaya Radishevskaya Street # 10, Moscow 109004, Russia
Venue:
Theoretical Computer Science
Year:
2003

Citing 2
Cited 2

On the valuedness of finite transducers

Acta Informatica
Introduction to the Theory of Computation

Introduction to the Theory of Computation

On almost periodicity criteria for morphic sequences in some particular cases

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Forbidden substrings, kolmogorov complexity and almost periodic sequences

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies properties of almost periodic sequences (also known as uniformly recursive).A sequence is almost periodic if for every finite string that ccurs infinitely many times in the sequence there exists a number m such that every segment of length m contains an ccurrence of the word.We study closure properties of the set of almost periodic sequences, ways to generate such sequences (including a general way), computability issues and Kolmogorov complexity of prefixes of almost periodic sequences.