On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. |
scientific article |
Statements
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (English)
0 references
17 January 2006
0 references
Finite state machine minimization
0 references
Approximation
0 references
Combinatorial problems
0 references
Computational complexity
0 references
Data structures
0 references
0 references
