|
In computer science a formal language is called recursive or decidable if there exists an algorithm to decide for any given string w over the alphabet of the language, if w belongs to the language or not.
More formally, a formal language is called recursive if and only if it is a recursive subset in the set of all possible words over the alphabet of the language.
All regular, context-free and context-sensitive languages are recursive.
|
