Question 1: FSAs, Regular Expressions, transformations Consider the following finite-state automaton A over = {0,2,4}: A = (, {90,91,92,93},8,90, {92}) where = {(90,0,41), (90,0,42), (90.4,93), (41,2,41), (91,2,42), (2, 4, 42). (42,2, 93), (93.292)} (e) Give, as a transition graph, the minimal deterministic FSA accepting the same language as A. Justify your answer, e.g. by following the marking table construction. [8 marks) (f) Give a regular expression for the language accepted by the automaton A. Justify your answer, e.g. by following the state-elimination procedure. [8 marks) (8) Consider now the following FSA B with e-transitions, over the alphabet = {0,2,4}. Compute an equivalent FSA without e-transitions. 0 90 91 92 E EN Justify your answer, e.g. by following the epsilon-removal construction. [8 marks]