Courses: Theory of Computation (CMSCH345B01)

Spring 2012

Introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity. Lab options as follows: F 11:30-12:00 or 12:00-12:30 or 12:30-1:00. Labs will be sectioned by course Professor.

Prerequisites: CMSC/MATH 231. Students must attend one, 1/2 hr. lab per wk.

Fulfills: NA Limit:24

Meeting Times

MW 11:30-1:00