Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Regular language

Known as: Rational language, Regular Languages, Cyclic language 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Introduction The Language of Thought Hypothesis (LOTH) is a concept in cognitive science which describes mental activity in the… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • S. Yu
  • J. Autom. Lang. Comb.
  • 2001
  • Corpus ID: 16103350
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Abstract The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • S. Yu
  • Handbook of Formal Languages
  • 1997
  • Corpus ID: 53716578
Now recall the definition of regular sets and some of the characterization results for this class. In particular, we know that… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Abstract We consider the state complexities of some basic operations on regular languages. We show that the number of states that… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Language learnability has been investigated. This refers to the following situation: A class of possible languages is specified… Expand
  • table I
Is this relevant?