On the Average Complexity of Moore's State Minimization Algorithm

Details On the Average Complexity of Moore's State Minimization Algorithm On the Average Complexity of Moore's State Minimization Algorithm

2009-02-06

arxiv.org/abs/0902.1048v1

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 123-134

Computer Science

Data Structures and Algorithms

Scientific paper

We prove that, for any arbitrary finite alphabet and for the uniform
distribution over deterministic and accessible automata with n states, the
average complexity of Moore's state minimization algorithm is in O(n log n).
Moreover this bound is tight in the case of unary utomata.

Affiliated with

Also associated with

No associations

Rating

On the Average Complexity of Moore's State Minimization Algorithm 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 the Average Complexity of Moore's State Minimization Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Average Complexity of Moore's State Minimization Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251584