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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
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… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • Sheng Yu
  • Journal of Automata, Languages and Combinatorics
  • 2001
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Yu, S., Q. Zhuang and K. Salomaa, The state complexities of some basic operations on regular languages, Theoretical Computer… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A famdy of efficient algorithms for referring certain subclasses of the regular languages from fmtte posttwe samples is presented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Let n be the pumping-lemma constant (note this n is unrelated to the n that is a local variable in the definition of the language… (More)
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Language learnabi l i ty has been inves t igated . This refers to the following s i tua t ion: A class of possible languages is… (More)
  • table I
Is this relevant?