Errata for First Printing of Automata, Computability, and Complexity: Theory and
Applications
Elaine Rich
Page
2
20
24
50
55
61
64
136
153
154
220
281
354
355
356
380
386
389
455
460
475
Location
Line 3
Exercise 6.c.
Example 3.5
Error
We don’t we just … => Why don’t we just …
Add ) before final }
Add + to produce “each of the substrings … is an
element of {0, 1, 2, 3, 4, 5, 6, 7, 8, 9)+ …”
Example 4.12
Add comma after “some function f”. Change two
instances of “counter example” to “counterexample”
FSM diagram
Each transition labeled D should advance two states.
Figure in Example 5.6
The dead state (labeled d) should not be accepting.
Figure in Example5.10 The state labeled U should be labeled O. The loop
back to it should be labeled Sigma - {u}
Final figure in Example The state with in-transition labeled a should not be
6.5
accepting.
Exercise 9
Two errors in the transition diagram: Label the arc
from q2 to q0 a. Make state q3 nonaccepting.
Exercise 15
In the transition diagram, the arc from q1 to q3
should have the single label b.
The derivations
In the left-most derivation, the four instances of
“The” should be “the”. In the right-most one, the
single instance of “The” should be “the”.
Figure 13.1
The caption is chopped off at the bottom. It should
say “yield”.
First chart
Get rid of the top row (labeled 4).
Second chart
Add “V, N” above the caption “saw” (as in the chart
above it).
Second chart
Second row (counting down from the top): Move VP
to the right so it aligns with VP on row 6. Third
row: Move NP to the right so it aligns with NP on
row 5. Fourth row: Move ProperNoun to the right
so it aligns with NP on row 5.
Example 17.11:
Delete the blank that occurs immediately after
Diagram of machine C writing x the first time. So after writing x, the code
is: L to a blank, L to a blank, write x, loop back.
Part (b) of Figure 17.3
Row 3, last separated column: Put a blank in the
empty square.
Tree in Figure 17.4
Label on root of tree: the “S” should be “s”.
Last four lines of step 3 Change five instances of “x” to “s”
of algorithm
First line
Change element-of symbol to not-element-of
symbol.
Title of Theorem 21.14 In “Is M …”, italicize “M”.
480-1
629
664
Continuation of
Theorem 21.18
Exercise 18
TM description in
middle of page
Tree in Example 28.1
Line 5 of proof
733
Line -15
746
First line of Table A.1
782
842
Title of Example A.17
Step 2 of the algorithm
853
853
855
874
955
Line 3
Line -14
Line -4
Line 9
Line 12
1016
Line -9 and -11
485
564
Continue the margin rule that marks theorems all the
way to just before the Section 21.6.3 heading.
“doubly reducible” should be bold italic.
Change two instance of L to q to L to blank.
The line between 1 and 5 should not be in bold.
Change “<G, k>” to “<G>” and change “<G, k, c>”
to “<G, c>”.
Get rid of word to before the quoted expression “to
find”.
Change first instance of P “and symbol” Q to P “or
symbol” Q.
The n in n-squared should not be bold.
Change “whose left-hand sides” to “whose left-hand
side”.
Insert } after ).
Insert “the” to produce “string that is the yield …”
Insert space after bullet.
Nuke subscript 1 after f.
Change “<M, w>” to “<M>”. Change “halt on w”
to “halt on epsilon”. (Use the symbol for epsilon.)
Insert a period after each statement (before the /*
part), as in Line -12.