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
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
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
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
Highly Cited
2001
Highly Cited
2001
This descriptive reference grammar of Nishnaabemwin (Odawa and Eastern Ojibwe), a major dialect group within contemporary Ojibwe… Expand
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
Highly Cited
1994
Highly Cited
1994
The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using… Expand
  • table 1
Highly Cited
1993
Highly Cited
1993
Recent work has shown that recurrent neural networks have the ability to learn finite state automata from examples. In particular… Expand
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
Highly Cited
1973
Highly Cited
1973
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is… Expand