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

Authors

287

  1. FO
    Friedrich Otto

    University of Kassel, Germany

    3 publications · 169 citations

    3

    h-index

  2. SA
    Sheila A. Greibach

    University of California, Los Angeles, United States

    3 publications · 71 citations

    3

    h-index

  3. JJ
    Janusz Jurek

    Jagiellonian University, Poland

    3 publications · 88 citations

    3

    h-index

  4. TA
    Tomoyuki Aotani

    The University of Tokyo, Japan

    3 publications · 48 citations

    3

    h-index

  5. AS
    Arto Salomaa

    Turku Centre for Computer Science, Finland

    3 publications · 34 citations

    3

    h-index

1–5 of 287

Venues

  1. SIAM Journal on Computing

    6 publications · 1.3K citations

    6

    h-index

  2. Theoretical Computer Science

    6 publications · 171 citations

    6

    h-index

  3. Information and Control

    6 publications · 138 citations

    6

    h-index

  4. Journal of the ACM

    JACM · 5 publications · 954 citations

    5

    h-index

  5. Information and Computation

    4 publications · 208 citations

    4

    h-index

1–5