Algorithm Analysis and Automata

Spring Term, 2014

Mondays, Wednesdays and Fridays, 12:20 to 1:10 pm
Room 404, Min Kao Engineering Building


Michael A. Langston

Teaching Assistants

Chad Effler
David Laughon
Kai Wang


Introduction to the Theory of Computation, Sipser, Cengage, ISBN-13: 9781133187790
Data Structures and Algorithm Analysis, Shaffer, Dover, ISBN-13: 9780486485829


This class is intended for computer science undergraduate students. It will cover the fundamentals of regular, context-free and recursively enumerable languages, as well as finite automata, pushdown automata and Turing Machines. Counting and combinatorics, with applications to the analysis of algorithms, will also be discussed. Three hours credit will be given. The only prerequisite is CS311 or an equivalent course in discrete structures.