Computer Science – Discrete Mathematics
Scientific paper
2006-07-03
Computer Science
Discrete Mathematics
12 pages. Continuation of the results from the paper "Strongly Almost Periodic Sequences under Finite Automata Mappings" on cs
Scientific paper
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.
No associations
LandOfFree
Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost Periodicity, Finite Automata Mappings and Related Effectiveness Issues will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-415573