Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues
<|reference_start|>Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues: 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.<|reference_end|>
@article{pritykin2006almost,
    title={Almost Periodicity, Finite Automata Mappings and Related Effectiveness
  Issues},
    author={Yuri Pritykin},
    journal={arXiv preprint arXiv:cs/0607009},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0607009},
    primaryClass={cs.DM}
}