linear bounded automaton

(redirected from LBA compete)

linear bounded automaton

[′lin·ē·ər ¦bau̇nd·əd ȯ′täm·ə‚tän]
(computer science)
A nondeterministic, one-tape Turing machine whose read/write head is confined to move only on a restricted section of tape initially containing the input.