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 language||English (US)|
|Number of pages||11|
|State||Published - Jan 2010|
All Science Journal Classification (ASJC) codes
- Almost periodic sequences
- Finite automata