The course will focus mostly on (1) and (2), but will
also cover some of (3): the classes P and NP, and NP-complete problems.
Applications
of (1) to programming (and natural) language specification and
parsing (top-down and bottom-up parsing) will be mentioned,
whenever appropriate.

Students are expected to have some undergraduate knowledge of the theory of computation. Some material assumed to be known will either not be covered in class or reviewed quickly. This material is marked with a (-). Materiall not required for the WPE is marked with a (*).

PART 1: Languages and Automata

- (-) Basics of language theory: alphabets, strings, concatenation, languages, operations on languages (including Kleene *)
- (-) Deterministic finite automata (DFA's)
- The cross-product construction
- (-) Nondeterministic finite automata (NFA's)
- From NFA's to DFA's, the subset algorithm (Rabin and Scott)
- An Application of NFA's: Text Search
- (-) Regular languages and regular expressions
- From regular expressions to NFA's
- From NFA's to regular expressions (node elimination)
- Closure properties of the regular languages
- Applications of regular expressions: Lexical analysis, finding patterns in text
- Right-invariant equivalence relations
- The Nerode/Myhill characterization theorem
- The pumping lemma for regular languages
- State equivalence, minimal DFA's
- (-) Context-free grammars and context-free languages
- (-) Leftmost derivations, rightmost derivations, parse trees
- The universality of leftmost derivations
- (-) Cleaning-up context-free grammars (e-rules, chain rules)
- (-) Chomsky Normal Form
- (-) Right-linear grammars and regular languages
- Eliminating useless productions
- Greibach Normal Form
- Tree domains, Gorn trees, and parse trees
- A strong pumping lemma for context-free languages: Ogden's lemma
- (-) Pushdown Automata (PDA's), instantaneous descriptions, acceptance modes
- DPDA's (Deterministic PDA's)
- From context-free grammars to PDA's
- From PDA's to context-free grammars
- (*) A glimpse at LR-parsing

PART II: Models of Computation and Basics of Recursive Function Theory

- (-) Generalities on computability, Partial Functions
- RAM programs (Post machines)
- Turing Machines
- RAM computable functions are Turing computable
- Turing computable functions are RAM computable
- Primitive recursive functions
- Recursive and partial recursive functions
- The equivalence of Turing computable functions and partial recursive functions
- Recursively enumerable languages and recursive languages
- Pairing Functions
- Coding of RAM programs
- Unsolvability of the Halting Problem
- A universal RAM program
- The Enumeration Theorem
- Kleenee's T-predicate
- Kleene Normal Form Theorem
- Acceptable Indexings
- The s-m-n Theorem
- Undecidable Problems
- K and TOTAL are not recursive
- Rice's Theorem for Recursive Sets
- Recursively Enumerable Sets
- Many-One reducibility
- Complete Sets (w.r.t. Many-One reducibility)
- (*) TOTAL is not re
- (*) TOTAL, FINITE, and their complements, are not re
- (*) The Recursion Theorem, versions 1, 2, 3
- (*) The Extended Rice Theorem
- (*) Productive and Creative Sets
- The undecidability of Post's correspondence problem
- Undecidable Properties of CFL's; Greibach's Theorem and applications
- (*) Undecidability of Hilbert's tenth problem (Solvabiliy of Diophantine Equations)
- (*) Diophantine sets = recursively enumerable sets
- (*) Diophantine definabiliy of the primes

PART III: Computational Complexity

- The class P
- Examples of Problems
- Boolean Satisfiability
- The class NP
- Polynomial-time reductions
- NP-completeness
- Cook's Theorem

Back to Gallier Homepage

*published by:
*