Linear Context-free Grammar

A Linear Context-Free Grammar is a context-free grammar in which each production rule has at most one nonterminal symbol on its right-hand side, thereby restricting derivations to linear structures.

43

Publications

2.2K

Citations

58

Authors

40

Institutions

Publications per year

2017–2026

1

Authors

58

  1. GS
    Giorgio Satta

    University of Padua, Italy

    5 publications · 200 citations

    5

    h-index

  2. DW
    David Weir

    University of Sussex, United Kingdom

    4 publications · 355 citations

    4

    h-index

  3. MK
    Marco Kuhlmann

    Linköping University, Sweden

    3 publications · 109 citations

    3

    h-index

  4. ML
    Markus Lohrey

    Leipzig University, Germany

    2 publications · 37 citations

    2

    h-index

  5. AJ
    Artur Jeż

    University of Wrocław, Poland

    2 publications · 37 citations

    2

    h-index

1–5 of 58

Venues

  1. Information and Control

    3 publications · 94 citations

    3

    h-index

  2. Theoretical Computer Science

    3 publications · 51 citations

    3

    h-index

  3. Information and Computation

    2 publications · 61 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 858 citations

    2

    h-index

  5. International Journal of Computer Mathematics

    2 publications · 56 citations

    2

    h-index

1–5