What is meant by linear bounded automaton in Theory of Automata and Formal Languages?

Correct Answer: B

a restricted Turing machine whose tape is bounded by a linear function of input length

The correct answer is a restricted Turing machine whose tape is bounded by a linear function of input length.