A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017)
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: A lower bound for the nondeterministic space complexity of context-free recognition |
scientific article; zbMATH DE number 92087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the nondeterministic space complexity of context-free recognition |
scientific article; zbMATH DE number 92087 |
Statements
A lower bound for the nondeterministic space complexity of context-free recognition (English)
0 references
16 January 1993
0 references
computational complexity
0 references
lower bound
0 references
nondeterministic space complexity
0 references
context-free language
0 references
0.92200994
0 references
0.8977777
0 references
0.8795563
0 references
0.86212003
0 references
0.85467446
0 references
0.8532373
0 references
0.8520473
0 references
0 references
