What is the number of states required in minimal DFA to accept the strings of a regu
that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?
(A) 6
(B) 11
(C) 12.
(D) 13
Answer
Answers
Answered by
1
Answer:
i hope help you my answer
Attachments:
Similar questions