Numeration systems on a regular language

Details Numeration systems on a regular language Numeration systems on a regular language

1999-03-04

arxiv.org/abs/cs/9903005v1

Computer Science

Other Computer Science

15 pages

Scientific paper

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study the translation and the multiplication by constants as well as the order dependence of the recognizability.

Affiliated with

Also associated with

No associations

Rating

Numeration systems on a regular language 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 Numeration systems on a regular language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numeration systems on a regular language will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231358