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.
2010
2010
Pumping lemmas for linear and nonlinear context-free languages
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pump… 
2005
2005
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
Two specific mappings called doublerfd and linearizerfl are introduced to bridge two domains of languages. That is, fd maps… 
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… 
2002
2002
Learning Locally Testable Even Linear Languages from Positive Data
Learning from positive data is a center goal in grammatical inference. Some language classes have been characterized in order to… 
1998
1998
On Simulating Non-Returning PC Grammar Systems with Returning Systems
1996
1996
A Note on the Grammatical Inference Problem for Even Linear Languages
This note introduces subclasses of even linear languages for which there exist inference algorithms using positive samples only. 
1990
1990
On characterizations of recursively enumerable languages
SummaryGeffert has shown that earch recursively enumerable languageL overΣ can be expressed in the formL{h(x)−1g(x)∣x in… 
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… 
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
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)