CMPSC 138 - Automata and Formal Languages

Formal languages; finite automata and regular expressions; properties of regular languages; pushdown automata and context-free grammars; properties of context-free languages; introduction to Turing machines and computability.

Prerequisites: Computer Science 40 with a grade of C or better; open to Computer Science and Computer Engineering majors only.

CMPSC 138

46 / 97 Enrolled

Automata and Formal Languages

Tevfik Bultan 3.4

M W

11:00 AM - 12:15 PM

43.2% A