The deltaFA-tool is a tool for the computation of delta-FA, a memory-efficient yet fast representation for DFAs.
It takes a DFA as input and computes a deltaFA representation as described in the paper:
- Ficara D., Giordano S., Procissi G., Vitucci F., Antichi G., Di Pietro A., "An
Improved DFA for fast regular expression matching", ACM SIGCOMM Computer Communication Review, October Issue 2008
This package includes a series of tools and programs that allow to sample regular expressions and walk the corresponding DFAs.
It includes also an interactive walker and a few simple libs you might want to modify freely.
The sampling idea is shown in the paper:
- Ficara D., Giordano S., Procissi G., Vitucci F., Antichi G., Di Pietro A., "Sampling
Techniques to accelerate regular expression matching in Intrusion Detection Systems", IEEE ICC 2010
DOWNLOAD Sampling utils
You might want to download the regex tool (Washington University) to generate a DFA from a list of regular expressions.
updated: Jan 22, 2010.