Professional Documents
Culture Documents
1.Design a DFA which accepts the only input 101 over the input set Z={0,1}
2.Design a DFA which checks whether the given binary number is even.
[Hint : Binary number is made up of 0’s and 1’s When any binary number ends with 0 it
is always even and when a binary number ends with 1 it is always odd. Eg:0100 is a
even number is equal to 4
3. Design a DFA which accepts odd number of 1’s and any number of 0’s
4. Derive the acceptable strings and non acceptable strings from the given DFA
5.Design a DFA for the set of all strings with three consecutive 0’s (not necessarily at
the end)
7.Design a DFA that the strings made up of letters in the word CHARIOT and
recognize those strings that contain the word CAT as a substring
(q1,0)={q1}
(q2,0)={q1}
(q1,1)={q2}
(q2,1)={q2}
10.Design a DFA for all binary strings whose decimal values are 2 k *3 where k>=0
[HINT: Before constructing DFA, We will analyse all the binary strings whose decimal
values are 2k *3 }