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

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
SummaryGeffert has shown that earch recursively enumerable languageL overΣ can be expressed in the formL{h(x)−1g(x)∣x in… Expand
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… Expand
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
An insertion grammar is based on pure rules of the form uv → uxv (the string x is inserted in the context (u, v)). A strict… Expand
Is this relevant?
1995
1995
  • Jean-Eric Pin Bull
  • 1995
  • Corpus ID: 6218904
This paper is an attempt to share with a larger audience some modern developments in the theory of finite automata. It is written… Expand
  • figure 3.2
  • figure 4.3
  • figure 4.4
  • figure 7.5
  • figure 7.6
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Abstract Datalog is a powerful query language for relational databases [10]. We consider the problems of determining containment… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 3.1
Is this relevant?
1985
1985
Abstract We give a homomorphic characterization of the class of recursively enumerable languages: it is shown that any… Expand
Is this relevant?
1981
1981
SummaryRecently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal… Expand
Is this relevant?
1980
1980
Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these… Expand
  • figure I
  • figure 2
Is this relevant?