UCSBPlat . CMPSC 138

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

13 / 100 Enrolled

Automata and Formal Languages

Ben Hardekopf 4.7

T R

17:00 PM - 18:15 PM

57.9% A

UCSBPlat.com

The admin of your beloved UCSBPlat.com

Promoted

Connect your AI agent to ucsbplat.com/mcp

Supercharge your AI to find better classes with UCSBPlat's official MCP server. Free to use.

Open UCSBPlat MCP endpoint