This is the study of mathematical foundations of computing, at a slower pace than that of CS 503 and with correspondingly fewer background assumptions. Topics include finite automata and regular languages, pushdown automata and context-free languages, Turing machines and decidability, and an introduction to computational complexity.
There will be a quiz each class, with the average of all quizzes making up %70 of your grade.
The remainder of grade will be the final exam.
Any missed quizzes will increase proportionately the amount of your grade
allotted to the final exam.
Assignment 1: Exercises from Chapter 1: 1-21, 23, 26
Assignment 2: Exercises from Chapter 1: 29, 31, 32, 33, 36, 39, 41, 42, 43, 44, 45, 46, 47, 48
Assignment 3: Exercises from Chapter 2: 1-41.
Assignment 4: Exercises from chapter 3: 6-26, 28, 29, 33
Assignment 5: Exercises from chapter 3: 35, 36.
Exercises from chapter 4: 1-24.
Assignment 6: Exercises from chapter 4: 25, 34.
Assignment 7: Exercises from chapter 5: 1, 2, 3, 5, 7, 9, 14 -- 22.
Assignment 8: Exercises from chapter 5: 24, 25, 27, 28, 33, 34, 36, 38, 39, 40, 41, 42