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.
Descriptional complexity of NFA of different a mbiguity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2verdicts
UNVERDICTED 2representative citing papers
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
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.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.