Published on 19 Jul 2013 | over 3 years ago

In this video I have discussed how to construct the minimal DFA which accepts set of all strings over {a,b} ,such that
(i) length of the string is 2
(ii) length of the string is atleast 2
(iii) length of the string is atmost 2
(iv) |w| mod 2=0,
(v) |w| mod 3=0,
(vi) no of 'a' in 'w' is 2,
(vii) no of 'a' in 'w' is congruent to (0 mod 2) ,
(viii) no of 'a' and 'b' both are congruent to (0 mod 2)

Loading related videos...