Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,262,795 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Chomsky hierarchy
Complexity class
Context-free grammar
Empty string
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Analyzing Context-Free Grammars Using an Incremental SAT Solver
Roland Axelsson
,
Keijo Heljanko
,
M. Lange
International Colloquium on Automata, Languages…
2008
Corpus ID: 15478665
We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some…
Expand
Review
2005
Review
2005
Inference of regular languages using state merging algorithms with search
M. Bugalho
,
Arlindo L. Oliveira
Pattern Recognition
2005
Corpus ID: 33197132
Highly Cited
2001
Highly Cited
2001
Nishnaabemwin Reference Grammar
J. Valentine
2001
Corpus ID: 60419878
This descriptive reference grammar of Nishnaabemwin (Odawa and Eastern Ojibwe), a major dialect group within contemporary Ojibwe…
Expand
Review
2000
Review
2000
Applications of Finite-State Transducers in Natural Language Processing
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…
Expand
1998
1998
Learning Regular Languages from Positive Evidence
Laura Firoiu
,
T. Oates
,
P. Cohen
1998
Corpus ID: 10803179
Abstract : Children face an enormously difficult task in learning their native language. It is widely believed that they do not…
Expand
Highly Cited
1998
Highly Cited
1998
Grammars Have Exceptions
Valter Crescenzi
,
G. Mecca
Information Systems
1998
Corpus ID: 14968522
Highly Cited
1995
Highly Cited
1995
DNA Computing Based on Splicing : The Existence of Universal Computers 1
Rudolf Freund
,
Lila Kari
1995
Corpus ID: 8945893
Splicing systems are generative mechanisms based on the splicing operation introduced by Tom Head as a model of DNA recombination…
Expand
Highly Cited
1994
Highly Cited
1994
Robust stochastic parsing using the inside-outside algorithm
Ted Briscoe
,
N. Waegner
arXiv.org
1994
Corpus ID: 14216855
The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using…
Expand
Highly Cited
1993
Highly Cited
1993
Learning Finite State Machines With Self-Clustering Recurrent Networks
Zheng Zeng
,
R. Goodman
,
Padhraic Smyth
Neural Computation
1993
Corpus ID: 159635
Recent work has shown that recurrent neural networks have the ability to learn finite state automata from examples. In particular…
Expand
Highly Cited
1992
Highly Cited
1992
A grammar-theoretic treatment of multiagent systems
J. Kelemen
,
A. Kelemenová
1992
Corpus ID: 62769087
A variant of cooperating and distributed grammar systems—the so-called colony—is studied to capture some aspects of multiagent…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE