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

29 / 97 Enrolled

Automata and Formal Languages

Tevfik Bultan 3.4

T R

12:30 PM - 13:45 PM

57.5% A