I have read in Wikipedia and some other texts thatThe halting problem is [...] decidable for linear bounded  automata (LBAs) [and] deterministic machines with finite memory.But earlier it is written that the halting problem is an undecidable problem and thus TM can't solve it! Since LBA are defined as a type of TM, should the same not hold for them?
Why is the halting problem decidable for LBA?
turing machines;automata;undecidability;halting problem;linear bounded automata