page 47, figure 1.19b. The state (s0, s1, s2) should be
represented by a double circle.
page 51, line 10. "element of V."
page 52, figure 1.21. The derivation is missing a step.
It should read S => XSZ => xSZ => xYZ => ...
page 91, lines 15 and 22. Change z to lambda.
page 91, line 32. Change "accepts the language" to "generates
the language"
page 98, lines 4-7. The grammar is missing the rule S -> XY.
page 99. Point out that L - {lambda} is context free.
page 121, figure 2.32. The arc leaving the initial state
should be labeled "lambda, lambda, #." Also, the label
on the arc from state p to q should have an upper case S
rather than a lower case.
page 136, prob 34. The last rule should read "X -> xy" rather
than X -> x.
page 176, prob 3. The last arc should be labeled Y/L rather
than Y/R.
page 179, figure 3.21. Should look like a Turing machine rather
than a finite automaton.
page 202, line 27. g(x) = 1 rather than g(x) = 0.
page 221, figure 4.12 (first two lines of step 2c).
delta x-bar delta y delta h(x-bar, y-1, f(x-bar, y-1)) delta
delta x-bar delta y delta h(x-bar, y-1, f(x-bar, y-1)) delta
page 224, line 34. Delete last ")".
page 225, lines 8 and 9. Exponent of b should be n-1.
page 241, line -3. Change 3 to 4.
page 241, line -5. Insert "and one more step to reach the halt state"
after "its original position".
page 241, line -7. Change 9 to 10.
page 247, line 6 (the formula). The sum starts at r = 0 rather
than r = 1.