Linear Bounded Automata (LBA)

Home > Languages > Formal Language > Finite Automata > Linear Bounded Automata (LBA)

It is a type of Turing machine that can only use a linear amount of space on the tape.