NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129)
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: NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY |
scientific article; zbMATH DE number 5597916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY |
scientific article; zbMATH DE number 5597916 |
Statements
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (English)
0 references
21 August 2009
0 references
nondeterministic finite automata
0 references
descriptional complexity
0 references
computational complexity
0 references
0 references
0 references
0 references
1.0000004
0 references
0.9559876
0 references
0.91563165
0 references
0.91109365
0 references
0.90914416
0 references
0.90834355
0 references
0.9071014
0 references
0.90469444
0 references
