Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01052081n
Noun Concept
Categories: Automata (computation), Models of computation
EN
linear bounded automaton  LBA  LBA-compete  LBA compete  linear bounded automata
EN
In computer science, a linear bounded automaton is a restricted form of Turing machine. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a linear bounded automaton is a restricted form of Turing machine. Wikipedia
A construct in computability theory Wikipedia Disambiguation
nondeterministic Turing machine with a potentially infinite tape on which to compute, in which computation is restricted to the portion of the tape containing the input plus the two tape squares holding the endmarkers Wikidata
IS A
nondeterministic Turing machine
Wikipedia
EN
linear bounded automaton
Wikidata
EN
linear bounded automaton
Wikipedia Redirections
EN
LBA-compete, LBA compete, linear bounded automata
Wikidata Alias
EN
LBA

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