Lecture Schedule CS 3240: Theory of Computation
Lecture Schedule CS 3240: Theory of Computation
Lecture Schedule CS 3240: Theory of Computation
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>CS</strong> <strong>3240</strong>: <strong>Theory</strong> <strong>of</strong> <strong>Computation</strong><br />
Summer 2011<br />
Version 7<br />
Section – B01 (MTWR 3:00-4:25p, <strong>CS</strong> 504)<br />
Pr<strong>of</strong>essor – Chuck Allison, Office <strong>CS</strong> 520g, 863-6389, chuck.allison@uvu.edu<br />
Office Hours – MTWR, 1:30-3:00p<br />
<strong>Lecture</strong> <strong>Schedule</strong><br />
Month Day Topics Reading Assignments<br />
Due<br />
June 27 Introduction 1.2 – 1.3; 2.1<br />
28 DFAs 2.1<br />
29 NFAs 2.2 – 2.3 Hw 2.1<br />
30 State Minimization 2.4 Program 1<br />
July 4 Independence Day<br />
5 Mealy Machines; R.Exp. A.1, A.2; 3.1 Hw 2.2-3<br />
6 Regular Expressions 3.2;<br />
bypass.doc<br />
Hw 2.4<br />
7 Regular Grammars 3.3 Hw Appx. A;<br />
Program 2<br />
11 Closure Properties,<br />
Decidability<br />
4.1 – 4.2 Hw 3.1-2<br />
12 Non-regular Languages 4.3 Hw 3.3<br />
13 Parsing; CFGs and Prog.<br />
Languages<br />
5.1-3;<br />
Sample<br />
CFGs<br />
Hw 4.1-2<br />
14 Transforming Grammars 6.1 Hw 4.3<br />
<strong>Theory</strong> <strong>of</strong> <strong>Computation</strong>! ! 1
18 CNF, CYK 6.2-3; CYK<br />
Algorithm<br />
Hw 5.1<br />
19 PDAs 7.1 Hw 5.2-3<br />
20 PDAs, CFG => PDA 7.1-2 Program 3;<br />
Hw 6.1<br />
21 PDA => CFG 7.2; pda2cfg Hw 6.2<br />
25 Pioneer Day Holiday<br />
26 DPDAs; Non-CFLs<br />
Closure, Decidability<br />
7.3 – 8.1 Hw 6.3<br />
27 Closure, Decidability 8.2 Hw 7.1<br />
28 Turing Machines 9.1 Hw 7.2<br />
August 1 More TMs; Church-<br />
Turing Thesis<br />
9.2 – 9.3 Hw 7.3<br />
2 TM Variations, UTMs 10.1 – 10.5 Hw 8.1-2<br />
3 R.E. Languages;<br />
Unrestricted Grammars<br />
11.1 – 11.2 Hw 9.1<br />
4 Chomsky Hierarchy 11.3 – 11.4 Hw 10.4<br />
8 Undecidability 1 12.1-2;<br />
Halting Dog<br />
Program 4<br />
9 Q & A Hw 11.1-2;<br />
12.1<br />
10 Final<br />
11 Final<br />
<strong>Theory</strong> <strong>of</strong> <strong>Computation</strong>! ! 2
Exam <strong>Schedule</strong><br />
Jul 8–9 Mid-term I (Chapters 1 – 3.2)<br />
Jul 29–Aug 1 Mid-Term II (Chapters 3.3 – 7.3)<br />
Aug 10–12 Final Exam (Also in Testing Center)<br />
NOTE: These dates are subject to change!<br />
<strong>Theory</strong> <strong>of</strong> <strong>Computation</strong>! ! 3
Change language