in Theory of Computation
867 views
0 votes
0 votes
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
in Theory of Computation
867 views

4 Answers

2 votes
2 votes
Best answer

Here is your answer

selected by
by

3 Comments

thank you .
0
0
well, transition table is correct but there's a mistake in the transition diagram. Transition of 134 state on input b is wrong. According to table it will be derives to 14 state whereas you derived it to 13 state. please make sure to correct it. rest all fine.
0
0
Bor, the table is correct.
0
0
0 votes
0 votes

Hope this will help out

0 votes
0 votes

.......

0 votes
0 votes

.....

Related questions