University:
California State University, Northridge
Course:
COMP 310 | Automata, Languages and Computation
Academic year:

2024
Views:

495

Pages:

6
Author:

Riley K.

10/16/24, 6:08 PM Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024) Midterm Due Oct 16 at 6:30pm Points 20 Questions 20 Available Oct 16 at 5:30pm - Oct 16 at 6:30pm 1 hour Time Limit None Attempt History LATEST Attempt Time Score Attempt 1 36 minutes 18 out of 20  Correct answers are hidden. Score for this quiz: 18 out of 20 Submitted Oct 16 at 6:07pm This attempt took 36 minutes.  Question 1 1 / 1 pts Given what is ?  Question 2 1 / 1 pts Given what is ?  Question 3 1 / 1 pts A string is... ... a symbol used in ... . . https://canvas.csun.edu/courses/154363/quizzes/573300 1/6 10/16/24, 6:08 PM ... Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024) . ... the Cartesian product  Question 4 1 / 1 pts Given , what is ?  Question 5 1 / 1 pts What is for:  IncorrectQuestion 6 0 / 1 pts Given the following definition for DFA https://canvas.csun.edu/courses/154363/quizzes/573300 , what is ? 2/6 10/16/24, 6:08 PM With Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024) given by the following table:  Question 7 1 / 1 pts What is for: https://canvas.csun.edu/courses/154363/quizzes/573300 3/6 10/16/24, 6:08 PM Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024)  Question 8 1 / 1 pts Given the following definition for DFA With , what is ? given by the following table:  Question 9 1 / 1 pts Select all features NFAs have over DFAs: is not a total function. . is a total function. transitions are not permitted. transitions are permitted.  Question 10 1 / 1 pts All DFAs can be transformed in to NFAs. True https://canvas.csun.edu/courses/154363/quizzes/573300 4/6 10/16/24, 6:08 PM Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024) False  Question 11 1 / 1 pts NFAs are more powerful than DFAs. True False  Question 12 1 / 1 pts Two finite accepters are equivalent if... ... their functions are the same. ... they contain the same number of states. ... their sets of final states are equal. ... they accept the same language.  Question 13 1 / 1 pts Regular expressions often do not have an equivalent DFA. True False  Question 14 1 / 1 pts Choose a string that is described by the regular expression .  IncorrectQuestion 15 0 / 1 pts Choose a string that is described by the regular expression https://canvas.csun.edu/courses/154363/quizzes/573300 . 5/6 10/16/24, 6:08 PM Midterm: COMP 310 AUTO LANG+COMPUTN - (16973-FA2024)  Question 16 1 / 1 pts Regular expressions accept most regular languages. True False  Question 17 1 / 1 pts The language is regular. True False  Question 18 1 / 1 pts It is impossible to determine if is regular, given that is regular. True False  Question 19 1 / 1 pts is regular if either or is regular. True False  Question 20 1 / 1 pts is regular if and are regular. True False Quiz Score: 18 out of 20 https://canvas.csun.edu/courses/154363/quizzes/573300 6/6