【作者单位】a College of Computer Science and Technology, Jilin University, Changchun, China b Department of Computer Science, Jilin Business and Technology College, Changchun, China
【摘要】 Glushkov's nondeterministic finite automaton leads to efficient regular expression matching. But it is memory greedy for long regular expressions. We develop space efficient representations for the deterministic finite automata obtained from Glushkov...
