The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.
A survey on regular expression matching for deep packet inspection: Applications, algorithms, and hardware platforms.IEEE Commun
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Formal Framework for the Explanation of Finite Automata Decisions
The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.