Data Structures/Automata/Graph Theory Question:

Here are some notes that might help via Google Drive: https://goo.gl/qkf1sb https://goo.gl/xnBSwv

1. RL and FSA-Total (40 points) Let ? = {0,1} 0,1 Figure 1 a. (10 pts) What is the regular expression generating the language recognized by the NFA in Figure 1? b. (20 pts) Convert the NFA in Figure 1 to a minimal DFA c. (10 pts) Consider the language L 1101o"1" |n, m 20). Is this a regular lan- guage! Hint: Use the pumping lemma an appropriate string 1100P1P