Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines

It is proved that oblivious simultaneously linear access-time and logarithmic space-bounded nondeterministic Turing machines are more powerful than deterministic ones. All the corresponding complexity classes are separated from each other.<
>