On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. |
scientific article; zbMATH DE number 2247939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. |
scientific article; zbMATH DE number 2247939 |
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
0.8767583966255188
0 references
0.87639319896698
0 references
0.8534119129180908
0 references
0.7975510358810425
0 references
