Reproduce “Hardness and Approximation for Compressing Deterministic Finite Automata” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Philip Bille, Inge Li Gørtz, Christoffer Krogh, Christian Møller Mikkelstrup
The authors analyze D²FA compression for signature-based deep packet inspection, where fallback transitions can replace repeated labeled transitions. Unlike forest-restricted compression, D²FA may use cycles when every character has a labeled transition on the cycle. They prove finding a minimum-size equivalent D²FA is NP-hard, while maximum-spanning-forest compression is at most 3/2 optimum size, a tight worst-case bound.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.