Question
In an automata or formal-language problem, which option best represents linear bounded automaton?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a restricted Turing machine whose tape is bounded by a linear function of input length
Explanation:
In this course context, linear bounded automaton means a restricted Turing machine whose tape is bounded by a linear function of input length.
Leave a Reply