MATH226A
Download as PDF
MATH 226A - Abstract Machines and Languages
Course Title
Abstract Machines and Languages
Course Description
Finite state automata, regular sets, Turing machines, recursive functions, decision problems. Context-free languages, pushdown automata, ambiguity, special families of languages, power series in non-commuting variables.
Minimum Units
4
Maximum Units
4
Grading Basis
Default Letter Grade; S/U Option