4003-389-01: Homeworks, Reading and Slides
Week 1
Week 2
- Slides for this week: Nondeterminism - see Week 1, and Regular Expressions - pdf
(ppt)
-
Tuesday, Sept 13
- Covered in class: closure properties of regular languages (finished Section 1.1),
started NFAs (Section 1.2)
-
Thursday, Sept 15
- Covered in class: solutions of Hw1
- Covered in class: formal definition of NFAs, equivalence of NFAs and DFAs (Section 1.2)
- Homework 2, due Thursday, 09/22, 4:00pm: click here
Bonus problems - no due date: Exercise 1.45, page 90, and Exercise 1.57, page 92.
It suffices to give the constructions, you do not have to prove their correctness. (I might ask you for the proof if I am having troubles verifying your construction - but hopefully that will not happen. :)
Please hand in your bonus problems on separate sheets of paper, not with your other homework problems.
(Note: as with most other courses, there is no partial credit for bonus problems.)
Week 3
- Slides for this week: Regular expressions - see week 2, and
Nonregular Lanuages - pdf
(ppt)
-
Tuesday, Sept 20
- Covered in class: finished NFA's, started regular expressions (Section 1.3)
- Hw2 due next class.
-
Thursday, Sept 22
- Covered in class: regular expressions, Kleene's Theorem (Section 1.3), started non-regular languages (Section 1.4)
- Homework 3, due Thursday, 09/29, 4:00pm: click here
Week 4
- Slides for this week: Nonregular Languages - see Week 3,
Myhill-Nerode Theorem - pdf
(ppt)
-
Tuesday, Sept 27
- Covered in class: Pumping Lemma (Section 1.4)
- Hw3 due next class.
-
Thursday, Sept 29
- Covered in class: the Myhill-Nerode Theorem and minimization of finite automata (see Problems at the end of Chapter 1)
- Covered in class: solutions of Hw 3
- Homework 4, due Thursday, 10/06, 4:00pm: click here
Week 5
- Slides for this week: Context-free Grammars - pdf
(ppt),
Pushdown Automata - pdf
(ppt)
-
Tuesday, Oct 4
- Covered in class: context-free grammars (Section 2.1)
-
Thursday, Oct 7
- Covered in class: Chomsky normal form, ambiguity
- Covered in class: started pushdown automata (Section 2.2)
- No homework due next week due to the midterm on Thursday, October 13, 4-5:50pm. Follow the posted link for more information about the midterm.
Week 6
- Slides for this week: Pushdown Automata - pdf
(ppt)
-
Tuesday, Oct 11
- Covered in class: pushdown automata, including their equivalence with CFGs
-
Thursday, Oct 13
- In class: midterm.
- Click here to see the variety of answers to question 6 on homework 4.
- Homework 5, due Thursday, 10/20, 4:00pm: click here
Bonus problems, no due date: Problem 2.22, page 130, and Problem 2.42, page 131.
Week 7
- Slides for this week:
Non-context-free languages - pdf
(ppt),
Turing Machines - pdf
(ppt),
Variants of Turing Machines - pdf
(ppt),
-
Tuesday, Oct 18
- Covered in class: solutions of Hw4
- Covered in class: equivalence of PDAs and CFGs (both ways), the pumping lemma for context-free languages
-
Thursday, Oct 20
- Class canceled due to sickness. To compensate, I will hold a final exam review during the finals week.
- Homework 6, due Thursday, 10/26, 4:00pm: click here
Week 8
- Slides for this week:
Defining Algorithm - pdf
(ppt),
Decidable Languages - pdf
(ppt),
Halting Problem - pdf
(ppt),
-
Tuesday, Oct 25
- Covered in class: Turing machines (Section 3.1), briefly discussed their variants - will come back to them on Thursday
- Homework 6 is due on Saturday 10/29 at 4pm (only electronic submissions - paper submissions are welcome on Thursday or Friday).
-
Thursday, Oct 27
- Covered in class: Variants of Turing machines (Section 3.2) and The Church-Turing Thesis (Section 3.3)
- Homework 7, due Thursday, 11/3, 4:00pm: click here
Week 9
- Slides for this week: we will continue with last week's slides, then Undecidable problems - pdf
(ppt)
-
Tuesday, Nov 1
- Covered in class: Decidable languages (Section 4.1) and the Halting problem (Section 4.2)
-
Thursday, Nov 3
- Covered in class: Other undecidable problems / reductions (Section 5.1)
- Homework 8, due Friday, 11/11, 2:00pm: click here
Week 10