I have this Turing machine example given in my book:
For the language $0^n1^n$. I understand how it works because it's very similar to a Finite State Machine.
But what I want to know is the following:
What is the $|-$ symbol is for what are the states $q_0$, $q_1$ doing in middle of everything. Unfortunately my textbook doesn't explain any of it.