Consider the following regular languages given below:
$R = 10 + 0 + 11$ $0 * 1$ over $\sum \left ( 0,1 \right )$ Let the number of states in the minimized $DFA$ of each of it be $n1 ,n2 , n3$ respectively. Then, which of the following is TRUE?
L2={ ε, a, b, aa, ab, ba,bb} DFA for L2 should have 4 states(including a dead state). Can anyone explain how DFA corresponding to L2 needs 10 states.
64.3k questions
77.9k answers
244k comments
80.0k users