Efficient priority minimization for deterministic parity automata with don't care words is possible via a general result; WDBA have unique minimal forms under trivial right-congruence don't cares with a congruence characterization, but the informative right-congruence class has no unique minimal and
Polynomial Identification of omega-Automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Minimization and Learning of Deterministic $\omega$-Automata in the Presence of Don't Care Words
Efficient priority minimization for deterministic parity automata with don't care words is possible via a general result; WDBA have unique minimal forms under trivial right-congruence don't cares with a congruence characterization, but the informative right-congruence class has no unique minimal and