AutoSlim prunes NFA transitions with a Random Forest that simply learns a score threshold, reporting hardware savings but no evidence that matching semantics are preserved.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
ML-Based Automata Simplification for Symbolic Accelerators
AutoSlim prunes NFA transitions with a Random Forest that simply learns a score threshold, reporting hardware savings but no evidence that matching semantics are preserved.