Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01052081n
Noun Concept
SYL
No term available
EN
In computer science, a linear bounded automaton is a restricted form of Turing machine. Wikipedia
Relations
Sources
IS A
EN
nondeterministic Turing machine

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