what is the number of states required in minimal dfa to accept the string of a regular language that contain 2 a's and 3 b's over the input alphabet {a,b}
Answers
Answered by
1
Answer:
i do no answered
Answered by
2
Answer:
6
Explanation:
becuse 2aand3b
Similar questions