The minimum consistent DFA problem cannot be approximated within any polynomial (Q4033836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum consistent DFA problem cannot be approximated within any polynomial |
scientific article; zbMATH DE number 166345 |
Statements
The minimum consistent DFA problem cannot be approximated within any polynomial (English)
0 references
16 May 1993
0 references
reducibility and completeness
0 references
computations on discrete structures
0 references
decision problems
0 references
approximation algorithms
0 references
minimization of finite state machines
0 references
nonapproximability
0 references
0.87639319896698
0 references
0.862237811088562
0 references
0.8346736431121826
0 references
0.8136857748031616
0 references
