Small NFAs from Regular Expressions: Some Experimental Results

Details Small NFAs from Regular Expressions: Some Experimental Results Small NFAs from Regular Expressions: Some Experimental Results

2010-09-19

arxiv.org/abs/1009.3599v1

Computer Science

Formal Languages and Automata Theory

Proceedings of 6th Conference on Computability in Europe (CIE 2010), pages 194-203, Ponta Delgada, Azores, Portugal, June/July

Scientific paper

Regular expressions (res), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata (NFA). We present the implementation of several algorithms for constructing small epsilon-free NFAss from res within the FAdo system, and a comparison of regular expression measures and NFA sizes based on experimental results obtained from uniform random generated res. For this analysis, nonredundant res and reduced res in star normal form were considered.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408596