NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57380806, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57380806 / rank | |||
Normal rank | |||
Revision as of 18:25, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY |
scientific article |
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
