We know that linear bounded automatons accept context-sensitive grammars.
Now suppose that we modify the LBA such that any location of the tape except the input part can be changed.What language does this automaton accept?
I think it is as strong as the standard Turing machine because we can copy the input part somewhere else and work with it like a semi-infinite Turing machine so that its tape is limited from the first symbol of the input that we copied.So it accepts recursively enumerable languages.Is this correct?