Question 1: FSAs, Regular Expressions, transformations Consider the following finite-state automaton A over = {0,2,4}: A = (E, {90,91,92,93}, 8.90, {92}) where 8 = {(90,0,41), (90,0,42), (90,4,93), (91,2,41), (91,2,42), (2, 4,92). (42,2,3), (93.2, 2)). (h) Consider now the regular expression over the alphabet = {0,2,4}: (42) 02*0 (4+2)* Give, as a transition graph, an FSA (possibly with s-transitions) recognising the same language as the regular expression Note that you cannot use compound transitions e.g. of the form 90 441 [6 marks] 0 Syntactically different regular expressions may represent the same language. Consider regular expressions over = {a,b}. Which of the following equations hold? 1. E + a= a + 3. b(a + b)*b = ba*b+b6*6 2. b + bb* = 5* 4. (ab+b)* = ((ab)*6*)* Briefly justify your answers. [8 marks]