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.
In: Esparza, J., Majumdar, R
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.
citing papers explorer
-
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.
-
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.