On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

Details On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

2007-04-02

arxiv.org/abs/0704.0218v1

Computer Science

Discrete Mathematics

9 pages. To be presented on 11th International Conference on Developments in Language Theory (DLT'2007), Turku, Finland, July

Scientific paper

In some particular cases we give criteria for morphic sequences to be almost
periodic (=uniformly recurrent). Namely, we deal with fixed points of
non-erasing morphisms and with automatic sequences. In both cases a
polynomial-time algorithm solving the problem is found. A result more or less
supporting the conjecture of decidability of the general problem is given.

Affiliated with

Also associated with

No associations

Rating

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases 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 On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492421