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
Is this relevant?
2015
2015
Speech recognition in a realistic noisy environment using multiple microphones is the focal point of the third CHiME challenge… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2005
2005
word and language operations on trajectories provide a general framework for the study of properties of sequential insertion and… Expand
  • figure 1
Is this relevant?
2005
2005
SummaryGeffert has shown that earch recursively enumerable languageL overΣ can be expressed in the formL{h(x)−1g(x)∣x in… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a simple, but expressive type system that supports strong updates - updating a memory cell to hold values of unrelated… Expand
  • figure 1
  • figure 3
Is this relevant?
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
Is this relevant?
1996
1996
Abstract An Automatic Language Identification (LID) approach is presented. The baseline LID system consists of three parts: (1… Expand
Is this relevant?
1994
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
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Abstract We show that the grammatical inference problem for even linear languages is reduced to the problem for regular sets. 
  • figure 1
Is this relevant?
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
Is this relevant?