SITE,
PROFESSOR: Ivan Stojmenovic
Introduction to Formal Languages
Fridays, 14:30 - 17:30
Introduction to Computer Theory, Daniel Cohen, Wiley, 2nd edition.
1. Jan. 5: Introduction, Languages, Recursive definitions (contains course outline, Ch. 1-3)
2. January 12, Regular Expressions (Ch. 4), Finite Automata (Chapter 5), Transition Graphs (Chap. 6)
3. January 19, Kleene's Theorem (Chapter 7)
4. January 26, Finite Automata with Output (Ch. 8) , Regular Languages (Ch. 9)
5. February 2, MIDTERM
6. February 9, Non-regular Languages (Ch. 10), Decidability (Ch. 11)
7. February 16, Context-Free Grammars (Ch. 12), Grammatical Format (=CNF, Ch. 13)
8. March 2, Pushdown Automata (Chapter 14)
Context-Free Grammars = Pushdown Automata Chapter 15 (pages 318-327)
9. March 9, Non-Context-Free Languages, Context-Free Languages (Chapters 16, 17)
10. March 16, Decidability (Chapter 18 “pages 402-410) Turing Machines (Chapters 19)
11. March 23, Recursively Enumerable Languages (Chapter 23)
12. March 30, Review
Midterm will cover Chapters 1-7, or the first three weeks of lectures. Closed book, 8 questions, 2.5h.
Solutions for midterm 2007 Sample final exam with solutions
Sample midterm Solutions to sample midterm
Assignment 1 Solutions to Assignment 1
Assignment 2 Pages in textbook containing assignment 2 questions
Solutions to Ass. 2 and few more questions from textbook
Assignment 3 deadline March 2 Solutions to assignment 3
Assignment 4 deadline March 23 Solutions to assignment 4
IMPORTANT:
Each student is required to do each assignment individually. Late assignments will NOT be accepted; they will receive a grade of 0.
An e-mail, with your assignment attached, should be send to the corrector
Aminul Islam aminul71@yahoo.com or mdislam@site.uottawa.ca by the due date.
Moreover, deposit a hard copy of your assignment in the LOCKED box marked CSI 3104 at the drop off area located at the south end of the first floor of the SITE building. You must staple the pages of your assignment together, and put it in an envelope. Include your Name, Student Number, Course number, and Assignment number on every page as well as on the envelope.