Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,756 papers from all fields of science
Search
Sign In
Create Free Account
Regular language
Known as:
Rational language
, Regular Languages
, Cyclic language
Expand
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AC0
Abstract family of languages
Ambiguous grammar
Aperiodic finite state automaton
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Complete suboptimal folding of RNA and the stability of secondary structures , Biopolymers
K. Reinert
2012
Corpus ID: 27815820
2011
2011
Software model checking using languages of nested trees
R. Alur
,
Swarat Chaudhuri
,
P. Madhusudan
TOPL
2011
Corpus ID: 7270996
While model checking of pushdown systems is by now an established technique in software verification, temporal logics and…
Expand
2005
2005
Regular frequency computations
Holger Austinat
,
V. Diekert
,
U. Hertrampf
,
H. Petersen
Theoretical Computer Science
2005
Corpus ID: 9802163
2005
2005
A decidable class of problems for control under partial observation
S. Pinchinat
,
Stéphane Riedweg
Information Processing Letters
2005
Corpus ID: 14602240
Review
2003
Review
2003
Signed real measure of regular languages
Amit Surana
,
A. Ray
42nd IEEE International Conference on Decision…
2003
Corpus ID: 60895484
This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control…
Expand
1992
1992
Efficient omega-Regular Language Containment
R. Hojati
,
H. Touati
,
R. Kurshan
,
R. Brayton
International Conference on Computer Aided…
1992
Corpus ID: 29771405
One method for proving properties about a design is by using L-automata [Kur90]. The main computation involves building the…
Expand
1990
1990
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars
E. Mäkinen
Information Processing Letters
1990
Corpus ID: 26324144
Highly Cited
1982
Highly Cited
1982
A structural analyzer for regularly arranged textures
T. Matsuyama
,
Kinjiro Saburi
,
M. Nagao
Computer Graphics and Image Processing
1982
Corpus ID: 1536826
1982
1982
A homomorphic characterization of principal semiAFLs without using intersection with regular sets
P. Turakainen
Information Sciences
1982
Corpus ID: 23487763
1981
1981
Recognize Regular Languages with Programmable Building-Blocks.
M. J. Foster
,
H. T. Kung
1981
Corpus ID: 61169443
Abstract : This paper introduces a new programmable building-block for recognition of regular languages. By combining three types…
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