Linear Bounded Automata Automata Theory Theoretical Computer Science

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.

    Top: Computers: Computer Science: Theoretical: Automata Theory: Linear Bounded Automata

See Also:

   MySQL - Cache Direct