Deterministic Context-free Languages

Deterministic Context-Free Language is a formal language that can be recognized by a deterministic pushdown automaton and is strictly contained within the class of context-free languages, distinguished by the property that no two distinct transitions exist for the same state, input symbol, and stack symbol combination.

58

Publications

2.5K

Citations

77

Authors

58

Institutions

Publications per year

2017–2026

2

Variants

DcflsDeterministic Context-free Language

Authors

77

  1. SA
    Sheila A. Greibach

    University of California, Los Angeles, United States

    3 publications · 293 citations

    3

    h-index

  2. SC
    Stephen Cook

    University of Toronto, Canada

    3 publications · 309 citations

    3

    h-index

  3. JH
    Juris Hartmanis

    Cornell University, United States

    2 publications · 66 citations

    2

    h-index

  4. SG
    Seymour Ginsburg

    University of Southern California, United States

    2 publications · 261 citations

    2

    h-index

  5. MW
    Matthias Wendlandt

    Justus-Liebig-Universität Gießen, Germany

    2 publications · 27 citations

    2

    h-index

1–5 of 77

Venues

  1. SIAM Journal on Computing

    9 publications · 266 citations

    9

    h-index

  2. Journal of the ACM

    JACM · 5 publications · 309 citations

    5

    h-index

  3. Theoretical Computer Science

    4 publications · 348 citations

    4

    h-index

  4. International Journal of Foundations of Computer Science

    IJFCS · 3 publications · 65 citations

    3

    h-index

  5. Journal of Computer and System Sciences

    2 publications · 247 citations

    2

    h-index

1–5