Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present a novel fine-tuning algorithm in a deep hybrid architecture for semisupervised text classification. During each… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
2012
2012
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a… Expand
  • figure 1
Highly Cited
2009
Highly Cited
2009
This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2005
2005
word and language operations on trajectories provide a general framework for the study of properties of sequential insertion and… Expand
  • figure 1
2002
2002
We describe a mechanism for automatically acquiring verb subcategorization frames and their frequencies in a large corpus. A… Expand
  • table 1
  • table 2
  • table 4
  • figure 1
  • table 5
Highly Cited
2000
Highly Cited
2000
In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their… Expand
Highly Cited
1994
Highly Cited
1994
Even Linear Language class is a subclass of context-free class. In this work we propose a characterization of this class using a… Expand
  • figure 1
  • figure 2
Highly Cited
1988
Highly Cited
1988
  • Y. Takada
  • Inf. Process. Lett.
  • 1988
  • Corpus ID: 5144749
Abstract We show that the grammatical inference problem for even linear languages is reduced to the problem for regular sets. 
  • figure 1
1978
1978
The intersection closure and the closure under homomorphic replication and intersection of certain classes of languages are… Expand
Highly Cited
1972
Highly Cited
1972
Topological characterizations of sets of graphs which can be generated by contextfree or linear grammars are given. It is shown… Expand
  • figure 4
  • figure 5