Compact DFA Representation for Fast Regular Expression Search

@inproceedings{Navarro2001CompactDR,
  title={Compact DFA Representation for Fast Regular Expression Search},
  author={Gonzalo Navarro and Mathieu Raffinot},
  booktitle={Algorithm Engineering},
  year={2001}
}
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speciic properties of Glushkov's nondeterministic nite automaton (NFA) construction algorithm, we are able to encode the DFA using (m + 1)(2 m+1 + jj) bits, where m is the number of characters (excluding operator symbols) in the regular expression and is the alphabet. This compares favorably against the worst case of (m+1)2 m+1 jj bits needed by a classical DFA representation and m(2 2m+1 + jj) bits needed… CONTINUE READING

From This Paper

Topics from this paper.
23 Citations
12 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Fast and exible string matching by combining bit-parallelism and su x automata

  • G. Navarro, M. Ra not
  • Journal of Experimental Algorithmics (JEA),
  • 2000

Taxonomies and Toolkits of Regular Language Algorithms

  • B. Watson
  • Phd. dissertation, Eindhoven University of…
  • 1995

Regular expressions into nite automata

  • A. Br uggemann-Klein
  • Theoretical Computer Science,
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…