Enumeration and Decidable Properties of Automatic Sequences

Details Enumeration and Decidable Properties of Automatic Sequences Enumeration and Decidable Properties of Automatic Sequences

2011-02-17

arxiv.org/abs/1102.3698v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give some new characterizations of the class of k-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems.

Affiliated with

Also associated with

No associations

Rating

Enumeration and Decidable Properties of Automatic Sequences 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 Enumeration and Decidable Properties of Automatic Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration and Decidable Properties of Automatic Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210926