Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03347556n
Noun Concept
AR
No term available
EN
In mathematics, logic and computer science, a formal language is called recursively enumerable if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings 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