4003-380-01: Homework, Reading and Slides
Week 1
- Slides for this week: Introduction (Chapter 0) - pdf (ppt),
Finite Automata (Section 1.1) - pdf (ppt)
-
Tuesday, Sept 6
- Covered in class: Course logistics.
- Covered in class: Chapter 0, introduction to CS theory, strings, and languages.
- Next class: Discrete math quiz, September 8, 2-2:30pm. There will be two problems. First, a basic discrete math reading,
writing, reasoning question. Second, a proof by mathematical induction (the simplest form of mathematical induction going from i to i+1,
see Section 0.4, pages 22-25, for an interesting example from real life). Feel free to download a
sample quiz. I recommend to use our
tutoring center for help.
- A note for students with disabilities:
RIT is committed to providing reasonable accommodations to students with disabilities.
If you would like to request accommodations such as special seating, testing modifications,
or note taking services due to a disability, please contact the Disability Services Office.
It is located in the Eastman Building, Room 2342; the Web site is www.rit.edu/dso.
After you receive accommodation approval, it is imperative that you see me during office hours
so that we can work out whatever arrangement is necessary.
Thursday, Sept 8
- In class: Discrete math quiz (30 min).
- Covered in class: solutions of the DM quiz.
- Covered in class: finished strings and languages (Chapter 0), started finite automata (Section 1.1)
Homework 1, due Wednesday, Sept 14, 2011, 4pm: pdf
Week 2
- Slides for this week: in addition to last week's slides, Nondeterministic finite automata (Section 1.2) - pdf (ppt)
-
Tuesday, Sep 13
- Covered in class: Section 1.1 (more finite automata examples, introduction to closure properties of regular languages)
-
Thursday, Sep 15
- Covered in class: finished Section 1.1 (closure properties of regular languages: union, intersection, concatenation)
- Covered in class: introduction to nondeterministic finite automata (Section 1.2)
- Covered in class: solutions of Hw1 (for problems 2&3&4, or any other homework related questions, please visit the tutoring center)
- Homework 2, due Wednesday, Sept 21, 2010, 4pm: pdf
Week 3
- Slides for this week: Regular Expressions (Section 1.3) - pdf
(ppt)
-
Tuesday, Sep 20
- Covered in class: formal definition of NFAs and their computation, converting NFAs to DFAs (the subset construction,
we will do the getting rid of the epsilon transitions part on Thursday)
-
Thursday, Sep 22
- Covered in class: finished Section 1.2, started Section 1.3
- For solutions of Homework 2 problems 1, 3, and 4, please visit the tutoring center. I will go over problem 2 in class on Tuesday.
- Homework 3, due Wednesday, September 28, 2011, 4pm: pdf
Week 4
- Slides for this week: Nonregular Languages (Section 1.4) - pdf
(ppt)
-
Tuesday, Sep 27
- Covered in class: regular expressions (Section 1.3)
-
Thursday, Sep 29
- Covered in class: an example of the the NFA -> regular expression construction.
- Covered in class: the Pumping Lemma for regular languages (Section 1.4)
- Covered in class: solution of Problem 2 on Homework 3
- Homework 4, due Wednesday, October 5, 2011, 4pm: pdf
Week 5
- Slides for this week: Myhill-Nerode Theorem and Minimization of DFAs - pdf
(ppt),
Context-free grammars (Section 2.1) - pdf
(ppt)
-
Tuesday, Oct 5
- Covered in class: more examples of nonregularity proofs via the pumping lemma
- Covered in class: the Myhill-Nerode Thm and the indistinguishability by L relation
- Covered in class: briefly discussed solution of problem 3 on Homework 3
-
Thursday, Oct 6
- Covered in class: finished the Myhill-Nerode Thm and the minimization algorithm for DFAs
- Covered in class: started context-free grammars (Section 2.1)
- Covered in class: solutions of Homework 4
- Recall that the midterm takes place next week,
Thursday, 2-3:50pm, in class. More info about the midterm can be found on the midterm website.
- No homework this week.
Week 6
- Slides for this week: we will continue with last week's slides
-
Tuesday, Oct 12
- Covered in class: CFGs - examples and closure properties
-
Thursday, Oct 13
- In class: midterm.
- Click here to see the variety of answers to question 5 on homework 4.
- Homework 5, due Wednesday, October 19, 2011, 4pm: pdf
Week 7
- Slides for this week: Pushdown automata (Section 2.2) - pdf
(ppt),
Non-context-free languages (Section 2.3) - pdf
(ppt)
-
Tuesday, Oct 18
- Covered in class: finished closure properties of regular languages, ambiguity, and Chomsky normal form (Section 2.1)
- Covered in class: Midterm solutions.
- Covered in class: started Pushdown automata (Section 2.2)
-
Thursday, Oct 20
- Class canceled due to sickness. To compensate, I will hold an extra final exam review during the finals week.
- Homework 6, due Thursday, October 26, 2011, 10am: pdf
Note: One of the homework problems asks you to apply a construction for converting CFGs into PDAs - we will go over it on Tuesday, or feel free to read about
the construction in the proof of Lemma 2.21. For this reason, I am extending the homework deadline to Thursday at 10am
(not later so that I can discuss the solutions in class). To submit your homework, either (a) upload it to MyCourses, (b) bring it to the tutoring center on Wednesday, or
(c) give it to me at 10am in class on Thursday.
Also, we have not defined acceptance of PDAs formally yet - informally, they accept when there exists a computation path to one of the accept states and
we get there after reading all input symbols. The stack does not have to be empty.
Week 8
Week 9
- Slides for this week: we will continue with last week's slides, then Decidable Languages (Section 4.1) - pdf
(ppt),
The Halting Problem (Section 4.2) - pdf
(ppt),
Undecidable problems (Section 5.1) - pdf
(ppt)
-
Tuesday, Nov 1
- Covered in class: finished Turing machines, started variants of Turing machines (Section 3.2)
-
Thursday, Nov 3
- Covered in class: finished variants of Turing machines (Section 3.2), defining algorithm (Section 3.3)
- Covered in class: Decidable languages (Section 4.1)
- Homework 8, due Friday, November 11, 2011, 2pm: pdf
Week 10