Question

What is the minimum number of states required in any dfa to accept the regular language l= {all binary strings that starts and ends with the same symbol}?
a, 3
b,4
c, 5
d, 6

Answer 1

Answer:

D ) 6

Explanation:

the above DFA, minimum number of states required is six