Units: 4
Hours: Lecture, 3 hours; discussion, 1 hour
Catalog page 276
Prerequisites: CS 010C with a grade of C- or better; CS 111; MATH 009C or MATH 09HC
Description: A study of formal languages. Includes regular and context-free languages; computational models for generating these languages such as finite-state automata, pushdown automata, regular expressions, and context- free grammars; mathematical properties of the languages and models; and equivalence between the models. Also introduces Turing machines and decidability.