An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem (Q2754541)
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: An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem |
scientific article; zbMATH DE number 1671259
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem |
scientific article; zbMATH DE number 1671259 |
Statements
15 October 2002
0 references
transition function
0 references
An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem (English)
0 references
0.7627567648887634
0 references
0.7572848796844482
0 references