Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01642214n
Noun Concept
EL
No term available
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
Relations
Sources
IS A
αναδρομικά αριθμήσιμα γλώσσα
HAS KIND
πλαίσιο-ευαίσθητα γλώσσα

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