00:01
Hello students, to design the high level description of a turing machine that recognizes the string consisting of even numbers of 1s, a tuning machine can be defined by its state, transition and behavior on a tape.
00:17
So here is a description for this.
00:19
So let's go for the turing machine description.
00:22
First let us know its states.
00:25
So the states for that it will be a q0, q1, q2, q3 and q4.
00:34
As q0 will be the initial state moving to the find first one and the q1 it will move to the it will move to the right to find the second one, first one it will find to the second one and the next is it will move to the right to find the first zero, first zero and after that and after the two ones, after the two ones.
01:10
Later as q3 it moves to the right to find the second zero, second zero and third it is an except state, except state.
01:24
The number of even ones is as the number of ones in a is an even.
01:31
So the next as the alphabets will be, the alphabets are as the symbol will be as symbols are zeros and one and like the blank symbol will be by the underscore.
01:49
So the next as the transition from the transition will be as the i have described in the state, the third part will be the transitions, transition states.
02:02
So that will be as it will first go to the q0 with the read zero and write zero and moving to to the next state as the q0.
02:17
So the next will be the q0 as it will move to the q0 and here it will read one and write one, move to the right to the next step q1.
02:26
So in a q1 it will read zero and write zero, move to the right to the next state as the q1.
02:33
Then later the q1 as read one, write one, move to the right next q2...