Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

34 relations
Abstract family of languagesArithmetical hierarchyAutomata theoryChomsky hierarchy

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
There are several variations of fuzzy Turing machines in the literature, many of them require a t-norm in order to establish… 
2005
2005
Polynomial Generators of Recursively Enumerable Languages
For each language L, let $\hat{\mathcal F}_\cap(L)$ be the smallest intersection-closed full AFL generated by the language L… 
1999
1999
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of… 
1997
1997
Series Recursively Enumerable Reals and Chaitin Numbers
A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting… 
1991
1991
Formal Languages and Power Series
  • A. Salomaa
  • Handbook of Theoretical Computer Science, Volume…
  • 1991
  • Corpus ID: 35545460
1984
1984
Decidable subspaces and recursively enumerable subspaces
Abstract A subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there… 
1981
1981
Flow languages equal recursively enumerable languages
SummaryRecently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal… 
1978
1978
Major subspaces of recursively enumerable vector spaces
The main point of this paper is a further development of some aspects of the recent theory of recursively enumerable (r.e… 
1976
1976
MONTAGUE GRAMMAR, GENERATIVE SEMANTICS, AND INTERPRETIVE SEMANTICS
1971
1971
Intersection-closed full AFL and the recursively enumerable languages
A study is made of conditions on a language L which ensure that the smallest intersection-closed full AFL containing L (written… 
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)