ahofa - Approximate Handling of Finite Automata
ahofa provides flexible methods for reducing non-deterministic finite automata (NFA) used in network traffic filtering. To achieve a substantial reduction of NFA, language over-approximation is used, since language preserving methods may not be sufficient. Besides reduction algorithms, other usefull programs are provided such as evaluation of reduced NFA error, and DFA minimization.
The NFA format (with .fa extension) is line-based and has the following structure:
<state> // initial state
<symbol> <state> <state> // transitions
...
<state> // final states
...
For positional and optional arguments run with -h option.
Reduction and error evaluation tool.
./app-reduction.py
NFA error evaluation.
./nfa_eval