Draw the transition diagram of a finite state automation that accepts all strings over {0, 1}

Draw the transition diagram of a finite state automation that accepts all strings over {0, 1}

(a) having odd number of 0’s

(b) having even number of 0’s and even number of 1’s.

Ans.  (a)

(having odd number of 0’s)

Ans.  (b)

(having even number of 0’s and even number of 1’s)