The implementation-level description of Turing machines that decides the following language over the alphabet {a,b,c} is given below.
But I feel that the state diagram and the set of configurations will give me more subtlety in understanding, could anyone suggest a book for me that contains this? or could anyone explain it thoroughly for me?
Also, I could not see the difference between the above The implementation-level description of Turing machines and the one given below:
Why both implementations are right?
Thanks!