This document provides feedback on a homework submission for a course on finite automata. It received a score of 2/5 and can be reattempted. The homework uses a technology that presents problems as multiple choice but requires showing work. A trace is given for the first problem. The second problem asks for a recurrence relation for the number of words a given automaton accepts. The third problem gives an induction proof that an automaton accepts strings with an odd number of 1's and asks to classify steps of the proof. The fourth problem asks which string is not accepted by a given NFA. The fifth problem asks which set of states is not accessible in the DFA constructed from a given NFA.
This document provides feedback on a homework submission for a course on finite automata. It received a score of 2/5 and can be reattempted. The homework uses a technology that presents problems as multiple choice but requires showing work. A trace is given for the first problem. The second problem asks for a recurrence relation for the number of words a given automaton accepts. The third problem gives an induction proof that an automaton accepts strings with an odd number of 1's and asks to classify steps of the proof. The fourth problem asks which string is not accepted by a given NFA. The fifth problem asks which set of states is not accessible in the DFA constructed from a given NFA.
This document provides feedback on a homework submission for a course on finite automata. It received a score of 2/5 and can be reattempted. The homework uses a technology that presents problems as multiple choice but requires showing work. A trace is given for the first problem. The second problem asks for a recurrence relation for the number of words a given automaton accepts. The third problem gives an induction proof that an automaton accepts strings with an odd number of 1's and asks to classify steps of the proof. The fourth problem asks which string is not accepted by a given NFA. The fifth problem asks which set of states is not accessible in the DFA constructed from a given NFA.
You submitted this homework on Mon 15 Sep 2014 11:59 PM PDT. You got a score of 2.00 out of 5.00. You can attempt again, if you'd like. The course will have a number of homeworks that are designed using the Gradiance technology. The objective of these homeworks is to enable everyone to get 100% and learn the underlying material. While questions look like multiple choice, you should think of them as more conventional "solve this problem and submit the solution" questions. That is, you are given a problem to solve, which you should work completely. Then, you are given a random choice of responses that are designed to figure out whether you got the right solution or not. If you do have the right solution, you should be able to answer the question easily, regardless of the choices presented. If you get it wrong, you will be given a hint and allowed to try again. Your score on a homework is the maximum of any try. We group about 5 questions together, so you can't repeatedly guess each question independently, without actually doing the work. Question 1 Examine the following DFA: Identify in the list below the string that this automaton accepts. Your Answer Score Explanation 101111 1.00 Correct. The sequence of states entered is A,C,D,B,D,B,D. Since D is an accepting state, the string is accepted. 0010110 1011000 011 Total 1.00 / 1.00 Question 2 The finite automaton below: accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equation for the number N(k) of words of length k that this automaton accepts. Discover this recurrence and demonstrate your understanding by identifying the correct value of N(k) for some particular k. Note: the recurrence does not have an easy-to-use closed form, so you will have to compute the first few values by hand. You do not have to compute N(k) for any k greater than 14. Your Answer Score Explanation N(11) = 682 N(14) = 0.00 General hint: To build your recurrence, suppose you have arrived at D. Think about what happens in response to the next input, 0 or 1, when 16 you leave D for either B or A. You will arrive back at D in a few more inputs, provided those inputs are "right." In general, when you have just arrived at D, not for the first time and after a sequence of k input symbols, you will have been at D a few inputs ago and then followed one of only a few different paths of different lengths. Specific hint: You may have almost the right recurrence, but you have miscalculated the number of ways you can get from D back to D. N(13) = 84 N(12) = 44 Total 0.00 / 1.00 Question 3 1Here is the transition function of a simple, deterministic automaton with start state A and accepting state B: 0 1 A A B B B A We want to show that this automaton accepts exactly those strings with an odd number of 1's, or more formally: (A,w) = B if and only if w has an odd number of 1's. Here, is the extended transition function of the automaton; that is, (A,w) is the state that the automaton is in after processing input string w. The proof of the statement above is an induction on the length of w. Below, we give the proof with reasons missing. You must give a reason for each step, and then demonstrate your understanding of the proof by classifying your reasons into the following three categories: A) Use of the inductive hypothesis. B) Reasoning about properties of deterministic finite automata, e.g., that if string s = yz, then (q,s) = ((q,y),z). C) Reasoning about properties of binary strings (strings of 0's and 1's), e.g., that every string is longer than any of its proper substrings. Basis (|w| = 0): (1) w = because ________ (2) (A,) = A because ________ (3) has an even number of 1's because ________ Induction (|w| = n > 0) (4) There are two cases: (a) when w = x1 and (b) when w = x0 because ________ Case (a): (5) In case (a), w has an odd number of 1's if and only if x has an even number of 1's because ________ (6) In case (a), (A,x) = A if and only if w has an odd number of 1's because ________ (7) In case (a), (A,w) = B if and only if w has an odd number of 1's because ________ Case (b): (8) In case (b), w has an odd number of 1's if and only if x has an odd number of 1's because ________ (9) In case (b), (A,x) = B if and only if w has an odd number of 1's because ________ (10) In case (b), (A,w) = B if and only if w has an odd number of 1's because ________ Your Answer Score Explanation (10) for reason C. (10) for reason B. (3) for reason A. (7) for reason C. 0.00 Can we conclude that (A,w) = B if and only if w has an odd number of 1's by reasoning only about strings? Total 0.00 / 1.00 Question 4 The following nondeterministic finite automaton: accepts which of the following strings? Your Answer Score Explanation 00110100 0010010 10011010 0.00 This string is not accepted. Here is a trace of the states the NFA enters while processing this input: {A}-1->{B}-0->{A,C}-0->{A}-1->{B}-1->{} At this point, the NFA is in the empty set of states, from which it can never accept. 00010111 Total 0.00 / 1.00 Question 5 Convert the following nondeterministic finite automaton: to a DFA, including the dead state, if necessary. Which of the following sets of NFA states is not a state of the DFA that is accessible from the start state of the DFA? Your Answer Score Explanation {B} {A} {A,B} {B,C} 1.00 Total 1.00 / 1.00
Calculus Made Easy: Being a Very-Simplest Introduction to Those Beautiful Methods of Reckoning Which are Generally Called by the Terrifying Names of the Differential Calculus and the Integral Calculus
Mental Math: How to Develop a Mind for Numbers, Rapid Calculations and Creative Math Tricks (Including Special Speed Math for SAT, GMAT and GRE Students)