Strongly Almost Periodic Sequences under Finite Automata Mappings

Details Strongly Almost Periodic Sequences under Finite Automata Mappings Strongly Almost Periodic Sequences under Finite Automata Mappings

2006-05-07

arxiv.org/abs/cs/0605026v1

Computer Science

Discrete Mathematics

7 pages

Scientific paper

The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be interesting in connection with computer science. The paper studies the class of eventually strongly almost periodic sequences (i. e., becoming strongly almost periodic after deleting some prefix). We prove that the property of eventual strong almost periodicity is preserved under the mappings done by finite automata and finite transducers. The class of almost periodic sequences includes the class of eventually strongly almost periodic sequences. We prove this inclusion to be strict.

Affiliated with

Also associated with

No associations

Rating

Strongly Almost Periodic Sequences under Finite Automata Mappings 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 Strongly Almost Periodic Sequences under Finite Automata Mappings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strongly Almost Periodic Sequences under Finite Automata Mappings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66983