CS 5353: Formal Languages, Automata, and Theory of Computation

A program for running NFAs can be downloaded from this tar file.

A program for running CFGs can be downloaded from this tar file.

A program for running TMs can be downloaded from this tar file.

Syllabus and Assignments

Syllabus

Homework 1, Homework 2, Homework 3, Homework 4, Homework 5, Homework 6.

Transparencies

Introduction.

Finite Automata, Nondeterminism, Regular Expressions, Nonregular Languages.

Context-Free Grammars, Pushdown Automata, Non-Context-Free Languages.

Turing Machines, Variants of Turing Machines, Definition of Algorithm.

Practical Use of Automata.

Decidable Problems, The Halting Problem.

Undecidable Problems, Post Correspondence Problem, Mapping Reducibility.

Measuring Complexity, The Class P, The Class NP, NP-Completeness, Additional NP-Complete Problems.

Circuit Complexity.

Back to Tom Bylander's Home Page