in Theory of Computation
488 views
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!!
in Theory of Computation
488 views

3 Comments

5?
0
0
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
0
elaborate more
0
0

2 Answers

0 votes
0 votes

Dfa takes 5 states

3 Comments

If you are finding difficulty in getting dfa directly then draw nfa using regX. :

$(0+1)^*(00+11)$

then convert to equivalaeq dfa.
0
0
Yeah i to got the same answer but answer is given in the answer sheet is 3-option D
0
0
I guess it is possible only if language contains only one symbol.
0
0
0 votes
0 votes
NFA when converted to DFA gives us 5 states, and after minimization of the dfa the number states remain 5.

Related questions