Comp 310 Auto Lang + Computn

4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) Midterm 1 Due No due date Points 41 Questions 21 Available until May 17 at 12:20pm Time Limit None Attempt History LATEST Attempt Time Score Attempt 1 54 minutes 29 out of 41 Submitted Mar 13 at 11:54am  Question 1 3 / 3 pts Select all that are correct Correct! Correct! Correct!  Question 2 0 / 3 pts Select all that are true You Answered Correct! https://canvas.csun.edu/courses/145981/quizzes/524836 1/7 4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) Correct Answer  Question 3 3 / 3 pts Provide a string w, such that |w|=4 and both w and wR are accepted by the following NFA. (if the picture does not show you can locate it under Files/MidtermFigures/Midterm1/5.pdf) 5-3.png Your Answer: w = 1010  Question 4 1.5 / 3 pts Select all languages that are accepted by the following FA (if the picture does not show you can locate it under Files/MidtermFigures/Midterm1/5.pdf) 5-4.png Correct! 101(0+1)* Correct Answer (0+1)*1010* 0*1*01(0+1)* 101* (100)*1  Question 5 3 / 3 pts Express in English sentence the language of the following DFA (if the picture does not show you can locate it under Files/MidtermFigures/Midterm1/1.pdf) 1.png Your Answer: https://canvas.csun.edu/courses/145981/quizzes/524836 2/7 4/30/24, 6:59 PM * * * Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) * * * * * 1 + (1 0 1 0 1 0 1 0 1 0 1 ) The language accepts Lamda, a string of only 1's and a string with 0's in multiples of 5 with any number of 1's.  Question 6 3 / 3 pts Select all that are correct for the following Finite Automata M. (if the picture does not show you can locate it under Files/MidtermFigures/Midterm1/3.pdf) 3-2.png L=((a2)*ab(b + a2 + ab)*)* L is finite L={a2nb2n : n>=0} M is a DFA Correct! L=(a2 + ab2 + aba(a+b))*  Question 7 1.5 / 3 pts For the r = (010 + 101)* regular expression, select all that are true L(r) = {w such that |w|mod3=0 and w is neither of the words 000 and 111 as substrings} L(r) = L ((010)* + (101)*) 0101101 is in L(r) Correct! 101101010101 is in L(r) Correct Answer L(r) is a subset of the set L={w such that |w|mod3=0 and w is neither of the words 000 and 111 as substrings}  Question 8 3 / 3 pts Let G be the following grammar . Select all that are not derived by the grammar G https://canvas.csun.edu/courses/145981/quizzes/524836 3/7 4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) abbaa aaab Correct! babba aba  Question 9 0 / 3 pts Select all that are correct Correct! You Answered none of the stated are correct  Question 10 3 / 3 pts The regular expression of the language of the grammar given below is (0+1)*0 (01)*01* Correct! (1 + 0)*01* (01)*1 0*1*01* https://canvas.csun.edu/courses/145981/quizzes/524836 4/7 4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024)  Question 11 1 / 1 pts Every subset of is a regular language ( ) True Correct! False  Question 12 1 / 1 pts True Correct! False  Question 13 0 / 1 pts The language of all strings generated from the alphabet is {0,1} that contain neither 010101 nor 000111 as substrings is regular. Correct Answer True You Answered False  Question 14 0 / 1 pts If , then is regular Correct Answer True You Answered False  Question 15 1 / 1 pts If we take any regular expression that does not contain the * operation then the language of such regular expression can represent only finite languages. Correct! https://canvas.csun.edu/courses/145981/quizzes/524836 5/7 4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) True False  Question 16 1 / 1 pts All languages over alphabet {a,b} are regular languages True Correct! False  Question 17 0 / 1 pts If you convert the given Finite Automata into right linear grammar (with the process described in class) how any production rules will you get? (if the picture does not show you can locate it under Files/MidtermFigures/Midterm1/4.pdf) 4-3.png You Answered 7 8 (with margin: 0)  Question 18 1 / 1 pts L={1n| n is an integer, n<1000 and n is prime} is a regular language Correct! True False  Question 19 1 / 1 pts Every finite subset of is a regular language ( ) Correct! True False  https://canvas.csun.edu/courses/145981/quizzes/524836 6/7 4/30/24, 6:59 PM Midterm 1 : COMP 310 AUTO LANG+COMPUTN - (16008-SP2024) Question 20 1 / 1 pts r1(r2r1)* = (r1r2)*r1 Correct! True False  Question 21 1 / 1 pts It is possible to have two different regular expressions to represent the same regular language Correct! True False https://canvas.csun.edu/courses/145981/quizzes/524836 7/7