PLEASE ANSWER ALL PARTS

Note: This homework is about Regular Expression to NFA and back Q. 1 Maximum score 15 Let L be the language accepted by the following finite state machine: 9. b 9 Indicate, for each of the following regular expressions, whether it correctly describes L: (Answers are yes and no for the four cases) a) (a ba)bb*a. b) a b)a(bb*a)* c) ba ab*a. d) (a ba)(bb*a)* Q.2 Maximum score 15 Give a NFA for the following regular expression (ba ((a bb) a*b)). Q. 3 Maximum score 20 Give a regular expression for the following NFA Q. 3 Maximum score 20 Give a regular expre b 40 41 a b b Note: This homework is about Regular Expression to NFA and back Q. 1 Maximum score 15 Let L be the language accepted by the following finite state machine: b 9. b 9. Indicate, for each of the following regular expressions, whether it correctly describes L: (Answers are yes and no for the four cases) a) (a ba)bb*a. b) ( b)a(bb*a)* c) ba ab*a. d) (a ba)(bb*a)* Q.2 Maximum score 15 Give a NFA for the following regular expression (ba ((a bb) a*b)). Q. 3 Maximum score 20 Give a regular expression for the following NFA