Linear Bounded Automaton 3,6/5 2070 reviews
(redirected from Linear bounded automata)linear bounded automaton
A linear bounded automaton (LBA) is an abstract machine that would be identical to a Turing machine, except that during a computation with given input its tape-head is not allowed to move outside a bounded region of its infinite tape, the number of accessible tape-cells being a linear function of the input-size. Disk drill windows keygen. The tape itself has infinite length in order to accomodate inputs of arbitrary length.
[′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.
Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.
Link to this page:
Recent Pages
keeperlaserq.netlify.app© 2020