Context-sensitive Languages
Context-Sensitive Languages is a class of formal languages in which each production rule is of the form αAβ → αγβ, where A is a non-terminal symbol, α and β are strings of terminals and non-terminals, and γ is a non-empty string, thereby allowing derivations where replacements depend on the syntactic context in which a symbol appears.
172
Publications
10.2K
Citations
287
Authors
187
Institutions
Publications per year
2017–2026
14
Parents
172
Word problems requiring exponential time(Preliminary Report)
Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations
Nondeterministic Space is Closed under Complementation
Neil Immerman · SIAM Journal on Computing · 1988 · 649 citations
On Isomorphisms and Density of $NP$ and Other Complete Sets
L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations
Indexed Grammars—An Extension of Context-Free Grammars
Alfred V. Aho · Journal of the ACM · 1968 · 441 citations · Full text
1–5 of 172
287
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 287
187

Harvard University Press
Cambridge, United States
4 h-index
4 publications
298 citations
University of Washington
Seattle, United States
3 h-index
3 publications
56 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
3 publications
82 citations
University of Kassel
Kassel, Germany
3 h-index
4 publications
186 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
5 publications
81 citations
Tokyo Institute of Technology
Tokyo, Japan
3 h-index
8 publications
90 citations
Institute of Computer Science
Warsaw, Poland
3 h-index
5 publications
144 citations
Jagiellonian University
Krakow, Poland
3 h-index
4 publications
129 citations
1–8 of 187
6 publications · 1.3K citations
6
h-index
6 publications · 171 citations
6
h-index
6 publications · 138 citations
6
h-index
JACM · 5 publications · 954 citations
5
h-index
4 publications · 208 citations
4
h-index
1–5