Some Decision Questions Concerning the Time Complexity of Language Acceptors (Q5300846)
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: Some Decision Questions Concerning the Time Complexity of Language Acceptors |
scientific article; zbMATH DE number 6182451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Decision Questions Concerning the Time Complexity of Language Acceptors |
scientific article; zbMATH DE number 6182451 |
Statements
Some Decision Questions Concerning the Time Complexity of Language Acceptors (English)
0 references
28 June 2013
0 references
NFA
0 references
NPDA
0 references
counter machine
0 references
GSM
0 references
reversal-bounded counters
0 references
time complexity
0 references
decidable
0 references
undecidable
0 references
run-time equivalence
0 references
unambiguous
0 references
\(k\)-ambiguous
0 references
1.0000001
0 references
0.88145584
0 references
0.8811345
0 references
0.86632013
0 references
0.86178964
0 references
0.85283107
0 references
0.8495032
0 references
