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.
A Novel Family of Finite Automata for Recognizing and Learning -Regular Languages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.