Definition
A linear bounded automaton is a restricted Turing Machine where the tape length is bounded by a linear function of the input length . Usually, the tape is restricted to exactly the portion containing the input, bounded by endmarkers.
Language Class
LBAs accept Context-Sensitive Languages.
Decidability
The acceptance problem is Decidable, unlike .