Construction of regular languages and recognizability of polynomials

Details Construction of regular languages and recognizability of polynomials Construction of regular languages and recognizability of polynomials

1999-08-27

arxiv.org/abs/cs/9908018v1

Computer Science

Computational Complexity

11 pages

Scientific paper

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x] is a polynomial such that P(N) is a subset of N then we can construct a numeration system in which the set of representations of P(N) is regular. The main issue in this construction is to setup a regular language with a density function equals to P(n+1)-P(n) for n large enough.

Affiliated with

Also associated with

No associations

Rating

Construction of regular languages and recognizability of polynomials 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 Construction of regular languages and recognizability of polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of regular languages and recognizability of polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497656