An SMT-based active learning algorithm learns minimal nondeterministic weighted automata over arbitrary semirings, with partial correctness proofs, a sufficient termination condition, and experiments showing smaller models and fewer queries than baselines.
Experimental Evaluation of Classi- cal Automata Constructions
2 Pith papers cite this work, alongside 106 external citations. Polarity classification is still indexing.
2
Pith papers citing it
106
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.
citing papers explorer
-
SMT-Based Active Learning of Weighted Automata
An SMT-based active learning algorithm learns minimal nondeterministic weighted automata over arbitrary semirings, with partial correctness proofs, a sufficient termination condition, and experiments showing smaller models and fewer queries than baselines.
-
Deconstructing Subset Construction -- Reducing While Determinizing
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.