Description
Finite automata, context-free languages, Turing machines, computability.
Prerequisite: MATH 42 and CS 46B (with a grade of "C-" or better in each) or instructor consent.
Grading
Normal Grade Rules
Units
3
Page last generated: 10/30/2009 15:36:53
print
mail