recursively enumerable language
Sign in to saveAlso known as Turing-recognizable
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
In the Vinony graph
Vinony's link graph records 93 inbound references to recursively enumerable language, and connects out to subset, regular language and recursively enumerable set.
It sits within the topics Alan Turing, Formal languages and Mathematics of computing.
Vinony links it to 19 Wikipedia language editions.
Wikidata facts
- Subclass of
- formal language
Show 1 more fact
- different from
- recursively enumerable set
Sources (3)
via Wikidata · CC0
Connections
subset
Entity
regular language
Entity
recursively enumerable set
Entity
RE
Entity
mathematics
Entity
logic
Entity
computer science
Entity
International Standard Book Number
Entity
infinity
Entity
set
Entity
Turing machine
Entity
recursion
Entity
union
Entity
intersection
Entity
formal language
Entity
if and only if
Entity
complement
Entity
finite-state machine
Entity
automata theory
Entity
Chomsky hierarchy
Entity