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

Authors

42

  1. JH
    Juris Hartmanis

    Cornell University, United States

    2 publications · 680 citations

    2

    h-index

  2. LG
    Leslie G. Valiant

    Harvard University, United States

    1 publications · 255 citations

    1

    h-index

  3. AS
    Anna Slobodová

    Universität Trier, Germany

    1 publications · 16 citations

    1

    h-index

  4. PL
    Philip Lewis

    General Electric (United States), United States

    1 publications · 220 citations

    1

    h-index

  5. DD
    Ding‐Zhu Du

    The University of Texas at Dallas, United States

    1 publications · 23 citations

    1

    h-index

1–5 of 42

Venues

  1. Information and Control

    3 publications · 66 citations

    3

    h-index

  2. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 31 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 473 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 255 citations

    1

    h-index

  5. Acta Informatica

    1 publications · 23 citations

    1

    h-index

1–5