Linear bounded automata are a type of automaton that operates like a Turing machine but with a tape bounded by the length of the input string. They are more powerful than pushdown automata but less powerful than Turing machines. The computation is restricted to a constant bounded area between left and right end markers on the tape. Linear bounded automata accept context sensitive languages.