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

Authors

181

  1. JG
    Jozef Gruska

    Masaryk University, Czechia

    7 publications · 262 citations

    7

    h-index

  2. HB
    Harry B. Hunt

    University at Albany, State University of New York, United States

    4 publications · 96 citations

    4

    h-index

  3. WR
    Wojciech Rytter

    University of Warsaw, Poland

    4 publications · 63 citations

    4

    h-index

  4. JH
    Juris Hartmanis

    Cornell University, United States

    4 publications · 407 citations

    4

    h-index

  5. OF
    Olivier Finkel

    Centre National de la Recherche Scientifique, France

    4 publications · 150 citations

    4

    h-index

1–5 of 181

Venues

  1. Theoretical Computer Science

    26 publications · 963 citations

    16

    h-index

  2. Information and Control

    14 publications · 587 citations

    12

    h-index

  3. SIAM Journal on Computing

    9 publications · 608 citations

    9

    h-index

  4. Journal of Computer and System Sciences

    8 publications · 678 citations

    8

    h-index

  5. Information Processing Letters

    5 publications · 150 citations

    5

    h-index

1–5