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.
Developing a self-explanatory transformer
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 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.