Question

4 blank spaces

Complete the transition table of a DFA that accepts (a+b)*aa а b start 12 1 12 Final 3 3

Answer 1

DFA for (a+b) *aa → it means generate stoings which ends with a a. so the smallest string generated is aa So, DFA for an is 0 Now, we have to decide és b comes on state I then we accept of b on state i Donly not 2 and 3 if so any numbees then string to will not end with aa. so, & a 3 for state ② if a comes on this then it should also go to state I otherwise if it is on state 2 then string like abba is also accept and also does not goes to on state, 3 otherwise strings ends with b' is also accepted. so figal or ARD so 19 b a کا b

if a for state 3 comes can so it is on state 3 on itself because any number of 'a in last is accepted When b comes then et goes to state, otherwise if it goes to state 2 then string like aaba is also accepted and it is on states then string ends with b is also accepted. so final OFA is b 6 start final b Istate Istart 2 2 3 I final 3 3