Modified Linear Bounded Automata Language 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?
any location except i/p part means 

(total unbounded tape area - tape area that includes i/p string)

= (infinity length - finite length) as we know i/p string length is always finite

= infinity length

in the definition of linear bounded automata it is stated that the tape can be used as a function of the input string length.but here the portion that can be used is of infinite length which is obviously not a function of the input string length.So it acts as a turing machine.