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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Speech recognition in a realistic noisy environment using multiple microphones is the focal point of the third CHiME challenge… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2014
2014
Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt’02) as a tool to construct efficient chosen-ciphertext… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
Many approaches have been proposed over the years for the recognition of mathematical formulae from scanned documents. More… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different… (More)
Is this relevant?
1996
1996
A bstract.Lin ear lan guage class is a su bclass of context-free lan guage class. In t his paper, we propose an algorithm to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1981
Highly Cited
1981
  • Pierre Wolper
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
We start by proving that some properties of sequences are not expressible in Temporal Logic though they are expressible using for… (More)
Is this relevant?
1980
1980
It is shown that the family of all linear grammars with a fixed ratio between the sizes of the terminal strings on both sides of… (More)
  • 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… (More)
  • figure 4
  • figure 5
Is this relevant?
1964
1964
Parikh has shown that there are context-free languages which are inherently ambiguous; he gave an example of context-free… (More)
Is this relevant?
1964
1964
The aim of our work is to define a family of linear grammars which we shall call even linear grammars and to show that the… (More)
Is this relevant?