Beginner
Theory of Computation
Q30 / 100
What is a linear bounded automaton (LBA)?
Correct! Well done.
Incorrect.
The correct answer is B) A Turing machine whose tape is limited to the length of the input, recognizing context-sensitive languages
B
Correct Answer
A Turing machine whose tape is limited to the length of the input, recognizing context-sensitive languages
Explanation
An LBA is a nondeterministic Turing machine restricted to the tape length of the input. It recognizes exactly the context-sensitive languages (Type 1).
Progress
30/100