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
Sites 3
Loading new listings for you to review...
- Linear Bounded Automaton Wikipedia article defines LBA and shows their place in the Chomsky hierarchy.
- Linear Bounded Automata Set of slides for lectures on LBA.
- Linear-bounded Automaton Example of construction of an LBA to accept a particular context free language.