Complexity Of Context-free Language Problems
Complexity of Context-Free Language Problems is a theoretical framework in formal language theory that classifies decision problems associated with context-free languages according to their inherent computational difficulty, typically measured in terms of time and space complexity within the hierarchy of computational models.
134
Publications
7.7K
Citations
181
Authors
119
Institutions
Publications per year
2017–2026
3
Parents
134
Word problems requiring exponential time(Preliminary Report)
Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations
The mathematical theory of context-free languages
H. P. Edmundson · Information Storage and Retrieval · 1967 · 738 citations
On the Tape Complexity of Deterministic Context-Free Languages
I. Hal Sudborough · Journal of the ACM · 1978 · 227 citations · Full text
1–5 of 134
181
7
h-index
University at Albany, State University of New York, United States
4 publications · 96 citations
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 181
119

University of Waterloo
Waterloo, Canada
6 h-index
10 publications
289 citations

University of Turku
Turku, Finland
5 h-index
5 publications
125 citations
Princeton University
Princeton, United States
5 h-index
10 publications
354 citations

University of Minnesota
Minneapolis, United States
5 h-index
7 publications
227 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
5 publications
195 citations

University of Toronto
Toronto, Canada
4 h-index
4 publications
343 citations

University of Warsaw
Warsaw, Poland
4 h-index
5 publications
73 citations
Université Paris Cité
Paris, France
4 h-index
4 publications
150 citations
1–8 of 119
26 publications · 963 citations
16
h-index
14 publications · 587 citations
12
h-index
9 publications · 608 citations
9
h-index
8 publications · 678 citations
8
h-index
5 publications · 150 citations
5
h-index
1–5