1. Following the following algorithm to transform a Regular Expression into a Finite Automaton. a. Start by placing the

[answerhappygod]

1 Following The Following Algorithm To Transform A Regular Expression Into A Finite Automaton A Start By Placing The 1 (135.72 KiB) Viewed 14 times

1. Following the following algorithm to transform a Regular Expression into a Finite Automaton. a. Start by placing the regular expression on the edge between a start and final state: Regular expression Start b. Apply the following rules to obtain a finite automaton until all edges are labeled with either a letter or A (A-transition is the same as e-transition). (state i and state j could be the same state) R R+S transforms to S RS R transforms to R* A A transforms to c. (9pts) Use the above algorithm to construct an NFA for each of the following regular expressions over {a, b}. (An option for tools of drawing FA: https://madebyevan.com/fsm/) (a + b)* i. ii. (a* + b*)* iii. (a*b*)* d. (3pts) Do the above three regular expressions describe the same language? Explain your answer. 2. (4pts) Give the regular expression for the language described below or for the given FA over the alphabet {0, 1}. a. All strings over {0, 1} with exactly two 1's. b. All strings over {0, 1} whose number of 1's is even. R