Definition
Linear Bounded Automaton
A Turing machine is called linear bounded automaton if there exists a linear function , such that, for every input word of length , uses at most cells on the work tape during its computation.
Linear Bounded Automaton
A Turing machine is called linear bounded automaton if there exists a linear function , such that, for every input word of length , uses at most cells on the work tape during its computation.