Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,134,645 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.
2004
2004
Conservative extensions of regular languages
Béatrice Bouchou
,
Denio Duarte
,
Mirian Halfeld-Ferrari
,
D. Laurent
,
M. Musicante
XXIV International Conference of the Chilean…
2004
Corpus ID: 120185040
Given a regular expression E and a word w belonging to the language associated to E (i.e. w /spl isin/ L(E)), we consider the…
Expand
2001
2001
Diferente participación de los mecanismos de control en el cambio entre tareas regular frente al cambio al azar
Francisco J. Tornay
,
E. G. Milán
2001
Corpus ID: 142299669
Different implication of control mechanisms in the random and regular shift of mental set. In this study we explore the…
Expand
2000
2000
Decidable first-order transition logics for PA-processes
D. Lugiez
,
P. Schnoebelen
Information and Computation
2000
Corpus ID: 2704443
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
1996
1996
A unified framework for the specification and run-time detection of dynamic properties in distributed computations
Özalp Babaoglu
,
E. Fromentin
,
M. Raynal
Journal of Systems and Software
1996
Corpus ID: 532560
1993
1993
Detection and transcription of new words
B. Suhm
,
M. Woszczyna
,
A. Waibel
EUROSPEECH
1993
Corpus ID: 15099546
This paper describes a model which enables a speech recognition system to automatically detect new words and to provide a rough…
Expand
1991
1991
A Trellis-Based Algorithm For Estimating The Parameters Of Hidden Stochastic Context-Free Grammar
J. Kupiec
Human Language Technology - The Baltic Perspectiv
1991
Corpus ID: 2197535
The paper presents a new algorithm for estimating the parameters of a hidden stochastic context-free grammar. In contrast to the…
Expand
1988
1988
Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
Mineichi Kudo
,
M. Shimbo
Pattern Recognition
1988
Corpus ID: 2841282
Highly Cited
1979
Highly Cited
1979
Stochastic tree grammar inference for texture synthesis and discrimination
S. Lu
,
K. Fu
1979
Corpus ID: 60535950
1976
1976
Interactive Languages
Y. Ezawa
,
M. Mizumoto
,
J. Toyoda
,
Kokichi Tanaka
Journal of computer and system sciences (Print)
1976
Corpus ID: 5858285
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