
3. (10 points) Convert the following DFA to an equivalent DFA with two states, and thern construct a regular expression E such that the DFA accepts the language L(E) 0 1 91 %2 @ゆ 0 Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .