489 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!!

2 Answers

0 votes
0 votes

Dfa takes 5 states

Related questions

0 votes
0 votes
0 answers
1
ankit-saha asked Mar 24, 2022
338 views
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
0 votes
0 votes
2 answers
2
iarnav asked Mar 14, 2019
863 views
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
0 votes
0 votes
2 answers
3
aditi19 asked Dec 14, 2018
1,493 views
Given following NFAfind the minimal equivalent DFA
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?