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

Regular grammar

Known as: Left regular grammar, Right regular grammar 
In theoretical computer science and formal language theory, a regular grammar is a formal grammar that is right-regular or left-regular. Every… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Real-world videos of human activities exhibit temporal structure at various scales, long videos are typically composed out of… Expand
  • figure 2
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the… Expand
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Finite-state transducers are models that are being used in different areas of pattern recognition and computational linguistics… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This descriptive reference grammar of Nishnaabemwin (Odawa and Eastern Ojibwe), a major dialect group within contemporary Ojibwe… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generative… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The identifiers chosen by programmers as function names contain valuable information. They are often the starting point for… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
1998
1998
Abstract : Children face an enormously difficult task in learning their native language. It is widely believed that they do not… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • S. Yu
  • Handbook of Formal Languages
  • 1997
  • Corpus ID: 53716578
Now recall the definition of regular sets and some of the characterization results for this class. In particular, we know that… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abstract This paper describes two applications in speech recognition of the use of stochastic context-free grammars (SCFGs… Expand
Is this relevant?