CS 380 Course Syllabus
Overview
This course covers the classic fundamentals of formal language theory.
Topics are chosen to highlight the relationships between languages and
their corresponding grammars and machines.
Prerequisite
Mathematical maturity commensurate with the successful
completion of Computer Science 311 or its equivalent.
Milestones
Review of Countability, Diagonalization and Other Basic Concepts
Regular Languages, Finite Automata and the Myhill-Nerode Theorem
Context-Free Languages, Grammars and Push-Down Automata
Turing Machines, Decidability, Recursive and Recursively Enumerable Languages
Rice's Theorem, Cook's Theorem and the Chomsky Hierarchy
Grading
10% Homework
30% Exam I, to be held on February 16, 2010
30% Exam II, to be held on March 30, 2010
30% Exam III, to be held on May 6, 2010