Complexity and approximation for compressing automata

Finding an optimal delayed deterministic finite automaton is NP-hard.

A delayed deterministic finite automaton (D2FA\text{D}^2\text{FA}) can compress large deterministic finite automata (DFAs).

These DFAs are used in modern signature-based deep packet inspection systems.

A D2FA\text{D}^2\text{FA} 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 D2FA\text{D}^2\text{FA} size.

Cycles of default transitions can be valid and produce a smaller D2FA\text{D}^2\text{FA}.

Key facts

  • Finding an optimal D2FA\text{D}^2\text{FA} is NP-hard.
  • The standard approach provides a 3/23/2-approximation to the optimum.
  • Cycles of default transitions can produce a smaller D2FA\text{D}^2\text{FA}.

All sections

Edition