Module
UCLA CS 181 Theory of Computing Core
Sign in to add this module to your path and practice.
About
Core automata, formal languages, and computability curriculum matching classic UCLA CS 181 (and Sipser Ch. 0–5 / MIT 18.404 automata+computability portion). Assumes discrete math, proof fluency, and post-algorithms background (CS 32/33/35L/180). Focuses on models of computation, language classes, pumping lemmas, TMs, and undecidability rather than complexity or circuits/quantum variants of some modern offerings.
Goal
Independently design and convert among DFAs/NFAs/regexes, CFGs/PDAs, and TMs; prove (non)regularity and (non)context-freeness via pumping lemmas and constructions; prove decidability/undecidability via reductions and diagonalization; classify languages as regular/CFL/decidable/recognizable/undecidable and explain the Church-Turing thesis.
Prerequisites
Tutor
Ask questions about this module.
Hi — I'm your tutor for UCLA CS 181 Theory of Computing Core. Ask about the concepts, goal, or where you're stuck.