2006/07/03 by Yuri Pritykin, Pritykin, Yuri
Biochemistry, Genetics and Molecular Biology · Computer Science · #Chemical Synthesis and Analysis #Coding theory and cryptography #Discrete Mathematics (cs.DM) #F.1.1 #FOS: Computer and information sciences #G.2.1 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0607009
openalex publication_date 2006/07/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic sequences includes the class of eventually strongly almost periodic sequences, and we prove this inclusion to be strict. We prove that the class of eventually strongly almost periodic sequences is closed under finite automata mappings and finite transducers. Moreover, an effective form of this result is presented. Finally we consider some algorithmic questions concerning almost periodicity.