《形式语言与自动机》第二版英文版课后题答案.docVIP

Exercise 2.3.1 Here are the sets of NFA states represented by each of the DFA states A through H: A = {p}; B = {p,q}; C = {p,r}; D = {p,q,r}; E = {p,q,s}; F = {p,q,r,s}; G = {p,r,s}; H = {p,s}. 0 1 -A B A B D C C E A D F C *E F G *F F G *G E H *H E H Exercise 2.3.4(a) The idea is to use a state qi, for i = 0,1,...,9 to represent the idea that we have seen an input i and guessed that this is the repeated digit at the end. We also have state qs, the initial state, and qf, the final state. We stay in state qs all the time; it represents no guess having been made. The transition table: 0 1 ... 9 -qs {qs,q0} {qs,q1} ... {qs,q9} q0 {qf} {q0} ... {q0} q1 {q1} {qf} ... {q1} ... ... ... ... ... q9 {q9} {q9} ... {qf} *qf {} {} ... {} Solutions for Section 2.4 Exercise 2.4.1(a) Well use q0 as the start state. q1, q2, and q3 will recognize abc; q4, q5, and q6 will recognize abd, and q7 through q10 will recognize aacd. The transition table is: a b c d -q0 {q0,q1,q4,q7} {q0} {q0} {q0} q1 {} {q2} {} {} q2 {} {} {q3} {} *q3 {} {} {} {} q4 {} {q5} {} {} q5 {} {} {} {q6} *q6 {} {} {} {} q7 {q8} {} {} {} q8 {} {} {q9} {} q9 {} {} {} {q10} *q10 {} {} {} {} Exercise 2.4.2(a) The subset construction gives us the following states, each representing the subset of the NFA states indicated: A = {q0}; B = {q0,q1,q4,q7}; C = {q0,q1,q4,q7,q8}; D = {q0,q2,q5}; E = {q0,q9}; F = {q0,q3}; G = {q0,q6}; H = {q0,q10}. Note that F, G and H can be combined into one accepting state, or we can use these three state to signal the recognition of abc, abd, and aacd, respectively. a b c d -A B A A A B C D A A C C D E A D B A F G E B A A H *F B A A A *G B A A A *H B A A A Solutions for Section 2.5 Exercise 2.5.1 For part (a): the closure of p is just {p}; for q it is {p,q}, and for r it is {p,q,r}. For (b), begin by noticing that a always le