linear bounded automaton

/L IH1 N IY0 ER0 B AW0 N D AH0 D AO0 T AA0 M AH0 T AA0 N/
N
  1. 1

    In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.