CMSC 141
Automata & Language Theory
Finite automata & regular languages, pushdown automata & context free languages; Turing machines & recursively enumerable sets; linear-bounded automata & context-free languages; computability & the halting problem; undecidable
problems, recursive functions; & computational complexity.
Credits: 3.0
Prerequisites: CMSC 55 or Math 29
