Sols T2
Sols T2
Sols T2
Pgina 1 de 6
Exercise 2.2.2
The statement to be proved is -hat(q,xy) = -hat(-hat(q,x),y), and we proceed by induction on the
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013
Introduction to Automata Theory, Languages, and Computation: Solutions for Chap... Pgina 2 de 6
length of y. Basis: If y = , then the statement is -hat(q,x) = -hat(-hat(q,x),). This statement follows from the basis in the definition of -hat. Note that in applying this definition, we must treat -hat(q,x) as if it were just a state, say p. Then, the statement to be proved is p = -hat(p,), which is easy to recognize as the basis in the definition of -hat. Induction: Assume the statement for strings shorter than y, and break y = za, where a is the last symbol of y. The steps converting -hat(-hat(q,x),y) to -hat(q,xy) are summarized in the following table: Expression Reason -hat(-hat(q,x),y) Start -hat(-hat(q,x),za) y=za by assumption (-hat(-hat(q,x),z),a) Definition of -hat, treating -hat(q,x) as a state (-hat(q,xz),a) -hat(q,xza) -hat(q,xy) Inductive hypothesis Definition of -hat y=za
Exercise 2.2.4(a)
The intuitive meanings of states A, B, and C are that the string seen so far ends in 0, 1, or at least 2 zeros. 0 ->A B BC *C C 1 A A A
Exercise 2.2.6(a)
The trick is to realize that reading another bit either multiplies the number seen so far by 2 (if it is a 0), or multiplies by 2 and then adds 1 (if it is a 1). We don't need to remember the entire number seen --- just its remainder when divided by 5. That is, if we have any number of the form 5a+b, where b is the remainder, between 0 and 4, then 2(5a+b) = 10a+2b. Since 10a is surely divisible by 5, the remainder of 10a+2b is the same as the remainder of 2b when divided by 5. Since b, is 0, 1, 2, 3, or 4, we can tabulate the answers easily. The same idea holds if we want to consider what happens to 5a+b if we multiply by 2 and add 1. The table below shows this automaton. State qi means that the input seen so far has remainder i when divided by 5. ->*q0 q1 q2 q3 q4 0 q0 q2 q4 q1 q3 1 q1 q3 q0 q2 q4
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013
Introduction to Automata Theory, Languages, and Computation: Solutions for Chap... Pgina 3 de 6
There is a small matter, however, that this automaton accepts strings with leading 0's. Since the problem calls for accepting only those strings that begin with 1, we need an additional state s, the start state, and an additional ``dead state'' d. If, in state s, we see a 1 first, we act like q0; i.e., we go to state q1. However, if the first input is 0, we should never accept, so we go to state d, which we never leave. The complete automaton is: ->s *q0 q1 q2 q3 q4 d 0 d q0 q2 q4 q1 q3 d 1 q1 q1 q3 q0 q2 q4 d
Exercise 2.2.9
Part (a) is an easy induction on the length of w, starting at length 1. Basis: |w| = 1. Then -hat(q0,w) = -hat(qf,w), because w is a single symbol, and -hat agrees with on single symbols. Induction: Let w = za, so the inductive hypothesis applies to z. Then -hat(q0,w) = -hat(q0,za) = (-hat(q0,z),a) = (-hat(qf,z),a) [by the inductive hypothesis] = -hat(qf,za) = -hat(qf,w). For part (b), we know that -hat(q0,x) = qf. Since x, we know by part (a) that -hat(qf,x) = qf. It is then a simple induction on k to show that -hat(q0,xk) = qf. Basis: For k=1 the statement is given. Induction: Assume the statement for k-1; i.e., -hat(q0,xSUP>k-1) = qf. Using Exercise 2.2.2, -hat (q0,xk) = -hat(-hat(q0,xk-1),x) = -hat(qf,x) [by the inductive hypothesis] = qf [by (a)].
Exercise 2.2.10
The automaton tells whether the number of 1's seen is even (state A) or odd (state B), accepting in the latter case. It is an easy induction on |w| to show that dh(A,w) = A if and only if w has an even number of 1's. Basis: |w| = 0. Then w, the empty string surely has an even number of 1's, namely zero 1's, and -hat (A,w) = A. Induction: Assume the statement for strings shorter than w. Then w = za, where a is either 0 or 1. Case 1: a = 0. If w has an even number of 1's, so does z. By the inductive hypothesis, -hat(A,z) = A. The transitions of the DFA tell us -hat(A,w) = A. If w has an odd number of 1's, then so does z. By the inductive hypothesis, -hat(A,z) = B, and the transitions of the DFA tell us -hat(A,w) = B. Thus, in this case, -hat(A,w) = A if and only if w has an even number of 1's.
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013
Introduction to Automata Theory, Languages, and Computation: Solutions for Chap... Pgina 4 de 6
Case 2: a = 1. If w has an even number of 1's, then z has an odd number of 1's. By the inductive hypothesis, -hat(A,z) = B. The transitions of the DFA tell us -hat(A,w) = A. If w has an odd number of 1's, then z has an even number of 1's. By the inductive hypothesis, -hat(A,z) = A, and the transitions of the DFA tell us -hat(A,w) = B. Thus, in this case as well, -hat(A,w) = A if and only if w has an even number of 1's. Return to Top
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: ->qs q0 q1 ... q9 0 {qs,q0} {qf} {q1} ... {q9} 1 {qs,q1} {q0} {qf} ... {q9} {} ... ... ... ... ... ... 9 {qs,q9} {q0} {q1} ... {qf}
... {}
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013
Introduction to Automata Theory, Languages, and Computation: Solutions for Chap... Pgina 5 de 6
a {q0,q1,q4,q7} {} {} {} {} {} {} {q8} {} {} {}
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 E *F *G *H Return to Top a B C C B B B B B b A D D A A A A A c A A E F A A A A d A A A G H A A A
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013
Introduction to Automata Theory, Languages, and Computation: Solutions for Chap... Pgina 6 de 6
There are three DFA states accessible from the initial state, which is the closure of p, or {p}. Let A = {p}, B = {p,q}, and C = {p,q,r}. Then the transition table is: a ->A A BB *C C Return to Top b B C C c C C C
http://infolab.stanford.edu/~ullman/ialcsols/sol2.html
01/03/2013