Skip to search formSkip to main contentSkip to account menu

Linear grammar

Known as: Linear language, Right Linear Grammar 
In computer science, a linear grammar is a context-free grammar that has at most one nonterminal in the right hand side of each of its productions. A… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Computer scienceCone (formal languages)Context-free grammarContext-free language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
A graph-controlled insertion-deletion (GCID) system has several components and each component contains some insertion-deletion… 
2015
2015
Learning a Deep Hybrid Model for Semi-Supervised Text Classification
We present a novel fine-tuning algorithm in a deep hybrid architecture for semisupervised text classification. During each… 
2005
2005
Aspects of shuffle and deletion on trajectories
2002
2002
The Automatic Acquisition of Frequencies of Verb Subcategorization Frames from Tagged Corpora
We describe a mechanism for automatically acquiring verb subcategorization frames and their frequencies in a large corpus. A… 
Highly Cited
1994
Highly Cited
1994
A Characterization of Even Linear Languages and its Application to the Learning Problem
Even Linear Language class is a subclass of context-free class. In this work we propose a characterization of this class using a… 
1978
1978
Linear Languages and the Intersection Closures of Classes of Languages
The intersection closure and the closure under homomorphic replication and intersection of certain classes of languages are… 
1977
1977
The Structure of Context-Free Grammatical Families
Highly Cited
1976
Highly Cited
1976
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages
Highly Cited
1974
Highly Cited
1974
A Geometric Hierarchy of Languages
  • Nabil A. Khabbaz
  • Journal of computer and system sciences (Print)
  • 1974
  • Corpus ID: 8029777
Highly Cited
1972
Highly Cited
1972
Linear and Context-Free Graph Grammars
Topological characterizations of sets of graphs which can be generated by contextfree or linear grammars are given. It is shown… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)