Complexity and approximation for compressing automata
Finding an optimal delayed deterministic finite automaton is NP-hard.
A delayed deterministic finite automaton () can compress large deterministic finite automata (DFAs).
These DFAs are used in modern signature-based deep packet inspection systems.
A adds unlabeled default transitions to remove similar transitions.
Existing approaches restrict default transitions to form a forest.
This restriction means they do not guarantee an optimal size.
Cycles of default transitions can be valid and produce a smaller .
Key facts
- Finding an optimal is NP-hard.
- The standard approach provides a -approximation to the optimum.
- Cycles of default transitions can produce a smaller .