Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01642214n
Noun Concept
Categories: Computability theory, Recursion, Formal languages, Theory of computation
EN
recursive language  Algorithmically solvable  decidable language  recursive languages  Turing-decidable language
EN
In mathematics, logic and computer science, a formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, logic and computer science, a formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language. Wikipedia
recursive subset of the set of all possible finite sequences over the alphabet of the language Wikidata
IS A
recursively enumerable language
HAS KIND
context-sensitive language
Wikipedia
EN
recursive language
Wikidata
EN
recursive language
Wikipedia Redirections
EN
Algorithmically solvable, decidable language, recursive languages, Turing-decidable language, Turing-Decidable Languages

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License