Explore relationships

Recursive language

In mathematics, logic and computer science, a recursive (or decidable) language is a recursive subset of the Kleene closure of an alphabet. Equivalently, a formal language is recursive if there exists a Turing machine that decides the formal language.

Use + to expand a branch. Click a topic name to open its summary.