Question: You will design a DFA that accepts the regular expression (a+b)2ab. The alphabet is (a,b) The DFA has 3 states S(start state), 1, and 2
You will design a DFA that accepts the regular expression (a+b)2ab. The alphabet is (a,b) The DFA has 3 states S(start state), 1, and 2 (final) Complete the missing edges. The edge can be either one of the three possibilities a or b or a,b Edge from S to 1 is Edge from S to S is b Edge from 1 to 2 is Edge from 1 to 1 is Edge from 2 to S is Edge from 2 to 1 is
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
