Pages that link to "Item:Q2282132"
From MaRDI portal
The following pages link to A sufficient condition to polynomially compute a minimum separating DFA (Q2282132):
Displaying 4 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- Minimal separating sets for acceptance conditions in Muller automata (Q1575897) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach (Q4989704) (← links)