Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
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… 
Highly Cited
2004
Highly Cited
2004
Finite-state transducers are models that are being used in different areas of pattern recognition and computational linguistics… 
Highly Cited
2001
Highly Cited
2001
This descriptive reference grammar of Nishnaabemwin (Odawa and Eastern Ojibwe), a major dialect group within contemporary Ojibwe… 
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… 
Review
2000
Review
2000
  • L. Karttunen
  • International Conference on Implementation and…
  • 2000
  • Corpus ID: 16049736
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from… 
Highly Cited
1999
Highly Cited
1999
The identifiers chosen by programmers as function names contain valuable information. They are often the starting point for… 
Highly Cited
1999
Highly Cited
1999
Abstract. We prove that splicingsystems with finite components and certain controls on their work are computationallycomplete…