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

2024
Views:

56

Pages:

4
Author:

Samuel K.

Quiz 1 A+ Due Sep 18 at 5:40pm Points 3 Questions 3 Available Sep 18 at 5:30pm Sep 18 at 5:40pm 10 minutes Time Limit 10 Minutes Attempt History Attempt Time Score LATEST Attempt 1 7 minutes 3 out of 3 Score for this quiz: 3 out of 3 Submitted Sep 18 at 5:36pm This attempt took 7 minutes. Question 1 1/1 pts The string abba is accepted by the DFA whose & function is given by: a b 90 91 94 q1 q2 q1 q2 q0 q3 q3 q3 q3 94 94 94 Not enough information. True, the machine halts on a non-trap state True, abba is accepted by every DFA False the machine does not halt on 04. Question 2 1/1 pts What is 8" (qo, bbabb) given the following definition for a DFA: a b q0q0q1 q1 q2 q1 q2 q3 q2 43 43 43 92 01 Question 3 1 / 1 pts What is F in the definition of a DFA? The set of states. The set of final states. The alphabet. abba