Hand-drawn diagrams for problems 1-2 are acceptable.
1. For each of the languages A and B given below, show a statediagram of a deterministic finite state automaton (DFA) thatreconizes the language. The alphabet of the two languages is {a,b}. A={x | x (a+b)* contains 2n+3 a’s for n ≥ 0} B={x | x (a+b)* contains 3n+1 b’s for n ≥ 0}
2. Show a state diagram of a DFA that recognizes theintersection of the two languages given in problem 1.
Expert Answer
An answer will be send to you shortly. . . . .