In an automata or formal-language problem, which option best represents linear bounded automaton?

Correct Answer: C

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

In this course context, linear bounded automaton means a restricted Turing machine whose tape is bounded by a linear function of input length.