Linear bounded automaton

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


© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search