Almost periodicity, finite automata mappings, and related effectiveness issues

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We introduce a class of eventually almost periodic sequences where some suffix is almost periodic (i.e., uniformly recurrent). The class of generalized almost periodic sequences includes the class of eventually almost periodic sequences, and we prove this inclusion to be strict. We also prove that the class of eventually almost periodic sequences is closed under finite automata mappings and finite transductions. Moreover, we obtain an effective form of this result. In conclusion we consider some algorithmic questions related to the almost periodicity.

Original languageEnglish (US)
Pages (from-to)59-69
Number of pages11
JournalRussian Mathematics
Volume54
Issue number1
DOIs
StatePublished - Jan 2010
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Keywords

  • Almost periodic sequences
  • Effectiveness
  • Finite automata

Fingerprint Dive into the research topics of 'Almost periodicity, finite automata mappings, and related effectiveness issues'. Together they form a unique fingerprint.

Cite this