Finite Automation Determined Based on KMP Algorithms
Feng Li · Journal of Chongqing Three-gorges University · 2005
Non-deterministic finite automaton is translated into deterministic finite automaton. The time complexity is an exponent function. On small scale, a NFA witch recognize input string, is determined by the method in the paper, then the efficiency is raised