Sciweavers

CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
14 years 6 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu