Context-free Languages

Context-Free Languages is a class of formal languages that are precisely those generated by context-free grammars, equivalently recognized by pushdown automata, thereby forming a proper superset of the regular languages.

740

Publications

39.9K

Citations

895

Authors

427

Institutions

Publications per year

2017–2026

40

Authors

895

  1. SG
    Seymour Ginsburg

    University of Southern California, United States

    11 publications · 1.3K citations

    11

    h-index

  2. SA
    Sheila A. Greibach

    University of California, Los Angeles, United States

    11 publications · 867 citations

    11

    h-index

  3. JE
    Joost Engelfriet

    Leiden University, Netherlands

    10 publications · 378 citations

    10

    h-index

  4. GR
    Grzegorz Rozenberg

    Leiden University, Netherlands

    10 publications · 271 citations

    10

    h-index

  5. JD
    Jürgen Dassow

    Otto-von-Guericke-Universität Magdeburg, Germany

    10 publications · 158 citations

    10

    h-index

1–5 of 895

Venues

  1. Theoretical Computer Science

    72 publications · 2.6K citations

    26

    h-index

  2. Information and Control

    34 publications · 2.8K citations

    23

    h-index

  3. SIAM Journal on Computing

    30 publications · 1.4K citations

    22

    h-index

  4. Journal of Computer and System Sciences

    29 publications · 1.8K citations

    20

    h-index

  5. Journal of the ACM

    JACM · 25 publications · 2.6K citations

    16

    h-index

1–5