I know that when an NL Turing machine is allowed to go back and forth freely, the resulting class of problems solvable on it is NP.
But limit of two passes over the witness tape, does not seem to add much power to the NL machine, if at all.
I am stuck on this problem. What is the resulting complexity class? Is it still NL? How do I prove this?