What is the number of states required in minimal DFA to accept the strings of a regular language
that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?
(A) 6
(B) 11
(C) 12
(D) 13
Answers
Answered by
5
Answer:
a+b)∗a(a+b)(a+b) I draw the following DFA The minimum number of states is 4. The answer given is 8.
...
Related questions.
tags tag:apple
force match +apple
views views:100
score score:10
answers answers:2
Explanation:
Similar questions