CSCI 2670 -- Introduction to Theory of Computing -- Fall 2008
READING ASSIGNMENTS
Readings are from the text unless otherwise indicated.
HU and HMU refer to books on reserve -- see resources.
The current reading assignment is here.
-
For August 20 : Preface, Introduction, Chapter 1 (mathematical preliminaries),
and Sections 1 of Chapter 2.
Most of Chapter 1 should be a review of
material familiar from CSCI 2610 or the equivalent.
In Section 1.8, the
treatment of trees is more important than that of general digraphs.
-
For August 21 : finish Chapter 2 (languages)
Section 3.3 of HMU presents applications of regular expressions.
-
For August 26 : Chapter 3 (context-free grammars) through Section 2
Section 5.3 of HMU presents applications of CFGs.
-
For August 28 : finish Chapter 3
-
For September 2 : Chapter 4 through Section 4.3
-
For September 3 : Chapter 4 through Section 4.4
-
For September 4 : Sections 4.5 and 4.6
Note that Sections 4.7 and 4.8 are being skipped.
-
For September 9 : Sections 5.1, 5.2, and 5.3
-
For September 11 : Section 5.4
-
For September 16 : Sections 5.5 and 5.6
-
For September 18 : Section 5.7
The approach to DFA minimization taken in class was based on the treatment
in Section 3.4 of HU and Section 4.4 of HMU.
-
For September 24 : Sections 6.1 and 6.2
-
For September 25 : Sections 6.3 and 6.4
-
For September 30 : Sections 6.5 and 6.6
-
For October 2 : Section 6.7
-
For October 7 : Sections 7.1 and 7.2
-
For October 8 : Section 7.3
-
For October 9 : Section 7.4
-
For October 14 : Section 7.5
-
For October 15 : Sections 18.1 and 18.2
-
For October 16 : Sections 18.3, 18.4 and 18.5
The bottom-up parsing example
from the class session of October 16 is shown completed.
-
For October 21 : Sections 8.1 and 8.2
Here is the Turing machine
example from the class session of October 21.
-
For October 23 : Section 8.4.
The class discussion of Turing Machine design methods followed
Section 7.4 of HU and Section 8.3 of HMU.
-
For October 28 : Sections 8.3, 8.5 and 8.6.
-
For October 29 : Section 8.7.
-
For October 30 : Sections 9.1 and 9.2, then skim the rest of Chapter 9.
Note that Section 8.8 is being omitted.
-
For November 4 : Sections 11.1, 11.2 and 11.3.
Note that Chapter 10 is being omitted.
-
For November 5 : Sections 11.4 and 11.5.
-
For November 6 : Section 12.1.
HU Theorem 7.10 on page 172 fills in a gap left by the text,
proving that
any TM can be simulated by a TM which has input alphabet {0,1}
and tape alphabet {0,1,B}.
-
For November 11 : Sections 12.2 and 12.3.
-
For November 12 : Section 12.4.
-
For November 13 : Sections 14.1--14.4.
Note that Sections 12.5--12.7 and Chapter 13 are being omitted.
-
For November 18 : Sections 15.1--15.3.
Note that Sections 14.5--14.7 are being omitted.
-
For November 20 : Sections 15.4--15.5.
-
For December 2 : Sections 15.6--15.7.
-
For December 3 : Sections 15.8--15.9.