Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

50 relations
AC0Abstract family of languagesAmbiguous grammarAperiodic finite state automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The Role of Heritage Students in Incorporating Culture into Language Teaching
This study will consider how to integrate cultural elements into the teaching of a language that is typologically quite different… 
2006
2006
Splicing and Regularity
  • T. HeadD. Pixton
  • Recent Advances in Formal Languages and…
  • 2006
  • Corpus ID: 36164660
2005
2005
Regular frequency computations
2004
2004
Characterizations of quantum automata
1995
1995
Computing with Infinitary Logic
1992
1992
Efficient omega-Regular Language Containment
One method for proving properties about a design is by using L-automata [Kur90]. The main computation involves building the… 
1991
1991
Polynomial-time learning of very simple grammars from positive data
1990
1990
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars
1985
1985
Another generalization of Higman's well quasi order result on Sigma*
Highly Cited
1982
Highly Cited
1982
A structural analyzer for regularly arranged textures
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)