Automata, Algorithms and Complexity

Instructor(s): Mock
Institution: University of Alaska (Anchorage)
Category: Computer Science
Description: Study of the theory of computing and algorithm analysis and design. Topics include: context-free grammars and parsing, finite automata and regular languages; pushdown automata and context-free grammars, deterministic and nondeterministic Turing machines, decidability, and computability. In the algorithm domain, the course provides an introduction to analysis and complexity of algorithms, searching/sorting algorithms, mathematical algorithms, and graph theoretic algorithms. Introduction to complexity theory.

Santa Fe Institute