Polynomial-time DTMC model checking against FDFA ω-regular properties, plus FUFA model with single-exponential LTL translation and greater succinctness than FDFA or unambiguous Büchi automata.
Learning regular omega languages
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2verdicts
UNVERDICTED 2representative citing papers
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
citing papers explorer
-
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata
Polynomial-time DTMC model checking against FDFA ω-regular properties, plus FUFA model with single-exponential LTL translation and greater succinctness than FDFA or unambiguous Büchi automata.
-
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