A sufficient condition to polynomially compute a minimum separating DFA (Q2282132)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition to polynomially compute a minimum separating DFA |
scientific article |
Statements
A sufficient condition to polynomially compute a minimum separating DFA (English)
0 references
6 January 2020
0 references
minimal separating DFA
0 references
minimal consistent DFA
0 references
model checking
0 references
minimization of incompletely specified automata
0 references
