Design a DFA over Σ = {a,b} to accept the followinglanguage:
The language whose strings contain exactly two a’s and more thantwo b’s.
acceptable strings= {aabbb, baabbb, bbaba ,babbab…}
not acceptable strings = {λ,a, b, ab, aab, abababbb, …}
Expert Answer
An answer will be send to you shortly. . . . .