State Elimination Ordering Strategies: Some Experimental Results

Details State Elimination Ordering Strategies: Some Experimental Results State Elimination Ordering Strategies: Some Experimental Results

2010-08-10

arxiv.org/abs/1008.1656v1

EPTCS 31, 2010, pp. 139-148

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.16

Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuristics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random generated deterministic finite automata.

Affiliated with

Also associated with

No associations

Rating

State Elimination Ordering Strategies: Some Experimental Results 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 State Elimination Ordering Strategies: Some Experimental Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Elimination Ordering Strategies: Some Experimental Results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583280