Om luaL5 Hannay LULA LUMLUL ULLCLLL Uull!5 ICAICOT analysis. True False Question 14 (2 points) Given the following language: L = {w | w does not end with 01) and = {0, 1), find the DFA that recognizes L. a Hint: you may either attach a picture of your solution or write the transition table of your DFA in the following example format: Q101 q0|q1|q0 N B 1 u. Format Question 15 (2 points) Given the following language: L = {w w is either 01 or 10) and 2= {0, 1}, find the DFA that recognizes L. Hint: you may either attach a picture of your solution or write the transition table of your DFA in the following example format: Q10|1 qo | q1|q0 y BI U - Format 02 1 E Question 16 (2 points) Given the following language: L = {w | w starts and ends with different symbols) and - {0, 1}, find the DFA that recognizes L. Hint: you may either attach a picture of your solution or write the transition table of your DFA in the following example format: Q10|1 q0|q1|q0 y Format A a Question 17 (2 points) Given the following language: L = {w | w ends either with 01 or 12, or 20} and = {0, 1, 2}, find the NFA that recognizes L. Hint: you may either attach a picture of your solution or write the transition table of your NFA in the following example format: Q|0|1 qo|q1, q2|q0 V Format 00 Underline (Ctrl-U) 32 Add a File Record Audio Record Video Question 18 (2 points) Given the following language: L = {w/w ends with 110) and = {0, 1}, find the NFA that recognizes L. Hint: you may either attach a picture of your solution or write the transition table of your NFA in the following example format: h Q1011 qo| q1, q2 | q0 BIU - Format Question 19 (2 points) In plain English, describe the language described by this NFA. {a, b, c} and "e" transition represents epsilon transition. b q1 q2 93 q7 go a, b, c C 94 BIU Format Add a File Record Audio Record Video Question 20 (2 points) In plain English, describe the language described by this DFA. 0.1 1 92 q1 Start state Ei 9 Question 21 (2 points) What is the regular expression that is equivalent (i.e. expresses the same language) to the following DFA? hint: this DFA recognizes L = {w/w contains an odd number of 1's} q1 90 Start state B IU Format > Question 22 (4 points) Given the following NFA over 2 = {a, b), use subset construction algorithm to convert this NFA to DFA. Please note that "e" represents epsilon-transition. You can attach your final DFA as an image or use the following example format: Q-DFA | Q-NFA la do | SAC| d1 d1 | SEF | d2 a. b b B Please note that "e" represents epsilon-transition. You can attach your final DFA as an image or use the following example format: Q-DFA | Q-NFA la do | SAC|d1 d1 | SEF | d2 a, b 6 ab
