Recursively enumerable language

Known as: Turing recognizable, Recursively enumerable languages, Recognizable language 
In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
05101519692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
We consider shifted equality sets of the form EG(a, g1, g2) = {w | g1(w) = ag2(w)}, where g1 and g2 are nonerasing morphisms and… (More)
Is this relevant?
2001
2001
The present paper investigates identification of indexed families L of recursively enumerable languages from good examples. We… (More)
Is this relevant?
2001
2001
In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than… (More)
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1999
1999
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of… (More)
Is this relevant?
1998
1998
An insertion grammar is based on pure rules of the form uu + lc~v (the string x is inserted in the context (u,u)). A strict… (More)
Is this relevant?
1990
1990
Geffert has shown that earch recursively enumerable languageL overΣ can be expressed in the formL{h(x) −1 g(x)∣x inΔ +}∩Σ * where… (More)
Is this relevant?
1981
1981
Recently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal descriptive… (More)
Is this relevant?
1980
1980
Fixed point languages and equality languages of homomorphisms and dgsm mappings are considered. Some basic properties of these… (More)
  • figure I
  • figure 2
Is this relevant?
1971
1971
A study is made of conditions on a language L which ensure that the smallest intersection-closed full AFL containing L (written… (More)
Is this relevant?