A Regular Expression Matching Algorithm with Smart Finite Automaton
Kun Huang · Dianzi xuebao · 2012
This paper presents a novel Regex matching algorithm with Smart Finite Automaton(SFA),where branching transitions of the XFA are augmented with adding extra check instruments,so that back-off transitions between states are eliminated,avoiding unnecessary state transitions.Experimental results show that compared with the XFA,the SFA significantly improves the time/space efficiency,separately reducing 44.1% and 69.1% in terms of the memory consumption and memory accesses of state transitions.