0 votes 0 votes Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L has a)2 b)5 c)8 d)3 explain!! Theory of Computation theory-of-computation + – balaganesh asked Sep 24, 2018 balaganesh 489 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply manisha11 commented Sep 24, 2018 reply Follow Share 5? 0 votes 0 votes sandygate commented Sep 24, 2018 reply Follow Share d is the correct answer....if any one is getting 5 try to minimize the dfa but in that epsilon,a,b is also getting accepted...if i am wrong please correct me 0 votes 0 votes balaganesh commented Sep 25, 2018 reply Follow Share elaborate more 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Dfa takes 5 states HeadShot answered Sep 24, 2018 HeadShot comment Share Follow See all 3 Comments See all 3 3 Comments reply HeadShot commented Sep 24, 2018 reply Follow Share If you are finding difficulty in getting dfa directly then draw nfa using regX. : $(0+1)^*(00+11)$ then convert to equivalaeq dfa. 0 votes 0 votes balaganesh commented Sep 24, 2018 reply Follow Share Yeah i to got the same answer but answer is given in the answer sheet is 3-option D 0 votes 0 votes HeadShot commented Sep 24, 2018 reply Follow Share I guess it is possible only if language contains only one symbol. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes NFA when converted to DFA gives us 5 states, and after minimization of the dfa the number states remain 5. pradeepchaudhary answered Sep 29, 2018 pradeepchaudhary comment Share Follow See all 0 reply Please log in or register to add a comment.