of List Typographical Errors Theory of Computation: A Gentle Introduction by Efim Kinber and Carl Smith
Page xvi, 7 lines from the bottom, change "imporved" to "improved".
Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 4, second line from the bottom. Change "as a" to "and a" Page 5, last paragraph. Include 5 in the set of primes less than 10 (4 occurrences). Discovered by Matthew Kretchmar, Denison University Page 5, second line from the bottom. Change "like the" to "like E, the" Page 6, 6 lines from the bottom, change "subset" to "" Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 7, just before the last paragraph starting "There are several" insert "Our examples of relation are all binary in that the involve relations over pair of sets. Certainly the definition includes relations over triples, quadruples, etc., of sets. Consider a phone book with listing including name address and phone number. A possible relation over this triple might be all the people living at street address under 100 and phone numbers starting with the prefix 234." Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 7, 2nd line from the bottom, change "that a relation may" to "that a binary relation may" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology ^ Page 8, 2nd line from the top, change "R" to "R" Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 8, before Figure 1.1, Replace the paragraph before Figure 1.1 with: Suppose R is a relation over a pair of sets S and T such that for each a S there is at most one b T such that (a, b) R. Thus we say that R is a function. We will use the more familiar notation f : S T to indicate a function that takes inputs from the set S and returns elements from the set T . More formally, f S T and for each x S there is at most one y T such that f (x) = y, that is, (x, y) is in the relation. See Figure 1.1.
Discovered by Joseph Austin, St. Augustine's College Page 8, just after Figure 1.1, replace "from R to S" with "from S to T " in two places and replace "We call the set R" with "We call the set S". Discovered by Joseph Austin, St. Augustine's College Page 8, third line from the bottom. Change the sentence starting "A function f is oneto-one" to "A function f is one-to-one and onto, also called a bijection, if for any x Dom(f ) and y Dom(f ) if x = y then f (x) = f (y) and for each y in the range of f , there is an x Dom(f ) with f (x) = y." Discovered by Robert Sloan, University of Illinois at Chicago and Roberta Sabin, Loyola College Page 9, Exercise 1.2.c, the bar over the left hand set should extend over the entire set. Page 18, Line 3 below Figure 2.6, change "is any element" through the rest of the sentence to "is a pair of a state and a string." Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 22, 5th line from the bottom, change "labeled with an e" to "labeled with either a b or an e" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 25, just above Figure 2.15, change "connects a state in Q with" to "connects a state in S with". Discovered by Judith Newton, Thiel College Page 25, just above Figure 2.15, change the six occurences of "S" to "U " including the one in Figure 2.15. Make the same change 11 times on page 26 (including in Figure 2.12 and three times in Figure 2.17. Also change "s1 , . . . , sn " to "u1 , . . . , un " in Figure 2.15 on page 25, in Figures 2.16 and 2.17 on page 26 and four times in the first complete paragraph on page 27. Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 26, change three occurrences (including one in Figure 2.17) of "P " to "P " Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 29, in Figure 2.21, change "{}" to "". Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology
Page 29, line 1, change "deterministc" to "deterministic". Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 29, just after "(see Figure 2.23)" add the sentences: Note that the algorithm applied to the automaton of Figure 2.22 does not give exactly the automaton of Figure 2.23. The algorithm will produce several redundant states after the favorable one. These have been surpressed from Figure 2.23. Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 29, Change the last 3 sentences of section 2.3 (starting with "This problem") to: This problem can be resolved by a more clever design of the underlying nondeterminstic finite automaton. For these cases, consider a nondeterministic finite automaton where every state (except the initial and the favorable ones) has exactly two arrows coming out of it, one labeled by e. It turns out that the conversion algorithm applied to such a nondeterministic finite automaton produces a determinstic finite automaton that has limited branching and, thus, results in an efficient computer program. Discovered by Eric Allender, Rutgers University Page 33, lines 4 and 5, change "favorable state of L to the initial state of M " to "favorable state of A to the initial state of B" Discovered by Ian Lotinsky, University of Maryland Page 34, line 4, change regular langauge to regular language Discovered by Matthew Lockner, University of Northern Iowa Page 40, in Algorithm 2.4.1, in the first line, change "j may be equal k" to "j may equal k" Discovered by Phil Kirlin, University of Maryland Page 40, in Algorithm 2.4.1, in the first line of the for loop, replace "for every pair of nodes j and k" with "for every pair of nodes j and k different from i" Discovered by Walter Beck, University of Northern Iowa Page 41, in Figure 2.39, Steps (1) and (2), change the four (4) occurances of li,j to li,k . Discovered by Edwin Rijksen, Hogeschool Amsterdam Page 42, just after Figure 2.42, change "single loop labeled abb bb" to "single loop labeled bab bb" and in the next paragraph, change "expression is ab(abb bb) a." to "expression is ab(bab bb) a."
Discovered by Jacques Cohen, Brandeis University Page 45, 2 lines Example 2.5.2, change "plays vital" to "plays a vital" Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 47, Algorithm 2.6.1, change the second to last sentence that starts "Note that the length" to "Note that the length of every path being observed, including e transitions, is at most n|w|, where n is the number of states. Hence, only paths bounded by this length need be examined." Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 48, second paragraph, line 6, change "any positive integer m" to "any positive integer n" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 51, Algorithm 2.7.1, change "n = 0, 1, 2, . . ." to "n = 1, 2, 3, . . ." Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 51, last line, change "contains a favorable state" to "contains favorable states" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 54, Exercise 2.1 a, change "accepted" to "accepted." Discoverd by Phil Kirlin, University of Maryland Page 54, Exercise 2.1 b, change "and determine if it" to "and determine if it is accepted; also, determine if the automaton" Discovered by Judy Goldsmith, University of Kentucky Page 55, Exercise 2.4, change "the stings of length" to"the strings over the alphabet {a, b} of length" Discovered by Aaron Elkiss, University of Maryland Page 55, Exercise 2.5, change "number of a's in w . . . y mod n." to "number of a's in w is congruent to x mod m, and the number of b's in w is congruent to y mod n." Discovered by Judy Goldsmith, University of Kentucky Page 55, Exercise 2.6a, change "abab. and aabaab" to "abab and aabaab." Discoverd by Phil Kirlin, University of Maryland
Page 57, Exercise 2.8, The transition from state r to state t should be labeled a, b. Discovered by John Sloan, Western Washington University Page 60, in 2.16i. Eliminate the parenthetical remark. Discovered by Robert Sloan, University of Illinois at Chicago and Anthony Bucci, Brandeis University Page 64, in 2.27a. Change "a substring" to "a repeated nonempty substring" Discovered by Robert Sloan, University of Illinois at Chicago Page 66, Exercise 2.34.c. Remove the arror from node r to node p, and it's associated label. Discovered by Richard Croft, Eastern Oregon University Page 69, line -5, change "set or rules" to "set of rules" Discovered by Katsuhiko Kakehi, Waseda University Page 71, Definition 3.1.1, there is an extra space before the close parenthesis in the third bulleted item. Discovered by Ian Lotinsky, University of Maryland Page 71, line -12, there is an extra space before the period after "sentential forms". Discovered by Ian Lotinsky, University of Maryland Page 73, Example 3.1.4, there are some spacing problems around the brace before "big". Discovered by Ian Lotinsky, University of Maryland Page 75, Just before the end of Example 3.1.5, change "(See Exercise 3.12)" to "(See Exercise 3.10)" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 75. The rule "E u" needs to be added to Example 3.1.6. Page 75. The rule S Swhile(C){S}S; should be S Swhile(C){S}; S Page 77, line 2, change "Every derivation tree" to "Every parse tree" Discovered by Rudolf Fleischer, The Hong Kong University of Science Technology
Page and 79, line 5 of section 3.3, change "any transition (a, s)" to "any transition (s, a)" Discovered by Eng Tan, Thiel College Page 81, line -2, change "character onto the top" to "character a onto the top" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 83, transition (2) at the top needs a comma, change ")(" to "),(" Discovered by Ian Lotinsky, University of Maryland Page 86, replace action item 2 of the proof (starting "If the topmost symbol on the stack is a terminal") with "If the topmost symbol on the stack is a terminal, say a, then only move the head to the right and pop the stack if the current symbol matches the top of the stack; otherwise, A gets stuck." Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 87, Figure 3.6, in the first line of the table, change s0 to s. Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 87, Figure 3.6, delete the 7th line of the table. Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 87, Delete the sentence"Otherwise, its operation is deterministic." just prior to Figure 3.6. Discovered by Robert Sloan, University of Illinois at Chicago Page 88, line 3, change ")(" to "),(" Discovered by Ian Lotinsky, University of Maryland Page 88, Change two occurences of "A" to "M " in the statement of Theorem 3.4.2. Discovered by Mike Slattery, Marquette University Page 88, Replace the sentence starting 7 lines from the bottom of the second paragraph of the proof of Theorem 3.4.2 (starting "Now, every transition" ending with ".and, ") by "Now, every transition ((s0 , a, e), (q, )) is replaced by the set of transitions ((s0 , a, t), (q, t)) for every symbol t {}" Discovered by Eric Allender, Rutgers University Page 88, 9 lines from the bottom, change "L(A)" to "L(M )". Discovered by Ivan Grimm, Thiel College
Page 88, last sentence (continuing on page 99) Starting with "For example", replace the entire sentence with "For example, there may be no rule with left hand side [q, B1 , q1 ], since there was no corresponding transition ((q, c, B1 ), (q1 , )) in ". Discovered by Katsuhiko Kakehi, Waseda University Page 90, Rule 2, change ")(" to "),(" Discovered by Ian Lotinsky, University of Maryland Page 90, line -3, change ")(" to "),(" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 90, item 1, change "For every s Q, the rule" to "The rule" Discovered by Judy Goldsmith, University of Kentucky Page 91, line 6, change "L(M ) = L(A)" to "L(M ) = L(G)" Discovered by Mike Slattery, Marquette University Page 91, the sentence just before Theorem 2.4.4 needs a period Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 93, in Example 3.5.1, change "{a, b} -{a, b} aaabbb{a, b} " to "{a, b} -aaabbb" Discovered by Judy Goldsmith, University of Kentucky Page 95, Insert "We can assume that f (G) > 1." at the beginning of the proof of Lemma 3.6.2. Also, replace "leaves" by "nodes" in the third, second to last and last lines of the proof. Discovered by Mike Slattery, Marquette University Page 97, 6 lines from the bottom, change "Consider the string uxy" to "Consider the string uxz" Discovered by Eric Allender, Rutgers University Page 98, line -11, change "?." to "?" Discovered by Ian Lotinsky, University of Maryland Page 99, line 11. "that" should be "than" Page 100, line 2, change "if an only" to "if an only if" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology
Page 102. Eliminate rule "B ab" (the last rule on the page) Page 103. Add the rule S AXCa to the list of rules created by Algorithm 3.7.3. Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 104, In part 2 of the statement of Lemma 3.7.3, remove the comma before "is infinite" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 107, line 2 of the proof of Theorem 3.8.1, change "empty store" to "empty stack" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 110, Exercise 3.4. Change "Alter the grammar in Example 3.1.3" to "Alter the grammar in Example 3.1.3, using the same alphabets," Page 110, Exercise 3.5. Change "context free-grammars" to "context-free grammars" Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 114, Exercise 3.28, change "pushdown automata" to "deterministic pushdown automata". (This exercise should be moved to section 3.8) Discovered by Bala Kalyanasundaram, Georgetown University Page 114, Exercise 3.28, change "Example 3.4.1" to "Example 3.1.1" Discovered by Anthony Bucci, Brandeis University Page 115, in exercise 3.31 change " N T " to " N T " Discovered by Eric Allender, Rutgers University Page 116, in exercise 3.38d, the parenthetical remark should be removed. Discovered by Eric Allender, Rutgers University Page 125, Example 4.1.1, transition 3, change ")))" to "))" Discovered by Rudolf Fleischer, The Hong Kong University of Science and Technology Page 125, second to last pararagraph, change "yields a configuration C2 = (p, u1 bv1 ) in one step of computation" to "yields in one step of computation a configuration C2 = (p, u1 bv1 )" Discovered by Robert Sloan, University of Illinois at Chicago Page 129, second line of Example 4.1.3 change "containing nonblank symbols." to "con-
taining only nonblank symbols." Discovered by Roberta Sabin, Loyola College Page 131, in Figure 4.10, the arrow (labeled ), and the label, sho...