CSE 355 : Introduction to Theoretical Computer Science
Instructors: Dr. Chitta Baral
Course Structure
Credits: 3
Prerequisite: CSE 310
Objectives:
· Introduction to formal language theory and automata,
· Turing Machines,
· Decidability / undecidability,
· Recursive function theory, and
· Introduction to complexity theory.
Grading: The homework assignments constitute 30% of the total grades and the remaining 70% will be based on the 2-3 midterms and the final exam.
Exam schedule: End of February, Early April, Last day of Class, Day of Finals.
Required Text: "Introduction to automata theory, languages and computation",
Hopcroft, Motwani and Ullman; 3rd ed, Addison Wesley
Book website: http://www-db.stanford.edu/~ullman/ialc.html
Additional Reading
1. "Introduction to the Theory of Computation", Michael Sipser, PWS Publishers, ISBN: 053494728X (hardcover), 053495250X (paperback).
2. "Languages and Machines – An Introduction to the Theory of Computer Science", Thomas A. Sudkamp, Addison Wesley Longman, Incorporated, ISBN: 0201157683(hardcover).