Computer Science 250 - THEORETICAL FOUNDATIONS/CSC

Spring
2013
01
4.00
Judy Franklin

MWF 10:00-10:50

Smith College
37926-S13
FORD 241
jfrankli@smith.edu
Automata and finite state machines, regular sets and regular languages; push-down automata and context-free languages; linear-bounded automata; computability and Turing machines; nondeterminism and undecidability. Perl is used to illustrate regular language concepts. Prerequisites: 111 and MTH 153.
Permission is required for interchange registration during the add/drop period only.
Link to Campus Courses
Back to the Five College Course Schedule