Finding the growth rate of a regular language in polynomial time

Details Finding the growth rate of a regular language in polynomial time Finding the growth rate of a regular language in polynomial time

2007-11-30

arxiv.org/abs/0711.4990v1

Computer Science

Discrete Mathematics

Scientific paper

We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n
states and t transitions accepts a language of polynomial or exponential
growth. We also show that given a DFA accepting a language of polynomial
growth, we can determine the order of polynomial growth in quadratic time.

Affiliated with

Also associated with

No associations

Rating

Finding the growth rate of a regular language in polynomial time 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 Finding the growth rate of a regular language in polynomial time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding the growth rate of a regular language in polynomial time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703181