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
Parents
43
Rohit Parikh · Journal of the ACM · 1966 · 782 citations · Full text
Seymour Ginsburg, Edwin H. Spanier · Journal of Computer and System Sciences · 1968 · 81 citations
1–5 of 43
58
5
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 58
40

University of Padua
Padua, Italy
4 h-index
4 publications
166 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
6 publications
908 citations

Uppsala University
Uppsala, Sweden
3 h-index
3 publications
109 citations

University of Tübingen
Tübingen, Germany
2 h-index
3 publications
69 citations
Heinrich Heine University Düsseldorf
Düsseldorf, Germany
2 h-index
4 publications
43 citations
Queen's University
Kingston, Canada
2 h-index
2 publications
75 citations

University of Amsterdam
Amsterdam, The Netherlands
2 h-index
5 publications
140 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
41 citations
1–8 of 40
3 publications · 94 citations
3
h-index
3 publications · 51 citations
3
h-index
2 publications · 61 citations
2
h-index
JACM · 2 publications · 858 citations
2
h-index
2 publications · 56 citations
2
h-index
1–5