recursively enumerable language
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
Facts
2 properties- Subclass of
- formal language
- Different from
- recursively enumerable set[2]
🏷️ Also known as
en recursively enumerable language
en Turing-recognizable
cs rekurzivně spočetný jazyk
de semientscheidbare Sprache
de Typ-0-Sprache
de semi-entscheidbare Sprache
de rekursiv aufzählbare Sprache
es lenguaje recursivamente enumerable
es lenguaje recursivo enumerable
fa زبان شمارشپذیر بازگشتی
fr langage récursivement énumérable
it linguaggio ricorsivamente enumerabile
ja 帰納的可算言語
ko 귀납적가산언어
ko 순환 열거 언어
ko 재귀 열거 언어
pl język rekurencyjnie przeliczalny
pl Język rekursywnie przeliczalny
pt Linguagem de recursividade enumerada
pt linguagem recursivamente enumerável
🔖 Identifiers · 4
- OpenAlex ID
- C203702658
- Dictionary of Algorithms and Data Structures ID
- recursivelyEnumerableLang
- Freebase ID
- /m/0f8z3
- Microsoft Academic ID (discontinued)
- 203702658
🔗 Connections
Different from 1
Subclass of 1
Subtypes 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
recursively enumerable language is a type of formal language[1].