Linear bounded automata (LBA) are multi-track Turing machines which have only one tape, and this tape is exactly the same length as the input. The family of languages accepted by LBA is the family of context sensitive languages.

Related categories 1

Linear Bounded Automata
A course note chapter with a definition of LBA and examples. [PDF]
Linear Bounded Automata
Set of slides for lectures on LBA.
Linear Bounded Automaton
Wikipedia article defines LBA and shows their place in the Chomsky hierarchy.
Linear-bounded Automaton
Example of construction of an LBA to accept a particular context free language.
[Computer Mozilla]
Last update:
January 2, 2007 at 19:58:46 UTC
Computers
Games
Health
Home
News
Recreation
Reference
Regional
Science
Shopping
Society
Sports
All Languages
Arts
Business