Prove that it is undecidable whether a given LBA accepts a regular set
Question
I know for an LBA the emptiness problem is undecidable. However I am not clear on how to reduce the halting problem of Turing machines to this as LBAs are strictly computationally less powerful than Turing machines. Or should I approach with reductions using computational histories of a Turing machine on an input.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange