Complexity Of Context-sensitive Languages
The Complexity of Context-Sensitive Languages is a computational complexity-theoretic classification that characterizes the resource requirements, particularly space, necessary for recognizing languages generated by context-sensitive grammars, distinguishing it from other language classes in the Chomsky hierarchy by its equivalence to linear bounded automata and its containment within PSPACE.
22
Publications
1.6K
Citations
42
Authors
34
Institutions
Publications per year
2017–2026
1
Parents
22
On Isomorphisms and Density of $NP$ and Other Complete Sets
L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations
John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant · Journal of the ACM · 1977 · 255 citations · Full text
A Robust Class of Context-Sensitive Languages
Salvatore La Torre, P. Madhusudan, Gennaro Parlato · 2007 · 134 citations
1–5 of 22
42
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 42
34
University of Würzburg
Würzburg, Germany
2 h-index
2 publications
119 citations

Romanian Academy
Bucharest, Romania
1 h-index
1 publications
18 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
1 publications
89 citations

University of Salerno
Fisciano, Italy
1 h-index
1 publications
134 citations

Eötvös Loránd University
Budapest, Hungary
1 h-index
1 publications
10 citations
Brno University of Technology
Brno, Czechia
1 h-index
1 publications
10 citations
The University of Tokyo
Tokyo, Japan
1 h-index
1 publications
10 citations
Turku Centre for Computer Science
Turku, Finland
1 h-index
2 publications
26 citations
1–8 of 34
3 publications · 66 citations
3
h-index
Repository · 2 publications · 31 citations
2
h-index
2 publications · 473 citations
2
h-index
JACM · 1 publications · 255 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5