Pages that link to "Item:Q2908870"
From MaRDI portal
The following pages link to Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete (Q2908870):
Displaying 18 items.
- Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Büchi Automata Can Have Smaller Quotients (Q3012925) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- (Q3384896) (← links)
- (Q5021013) (← links)
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Q5039514) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words (Q6094518) (← links)
