Title: Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
Abstract: 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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>