Five College Consortium

THEORETICAL FOUNDATIONS/CSC

Semester: 
Fall
Year: 
2014
Subject Name: 
Computer Science
Course Number: 
250
Institution: 
Smith College
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.
Instructor Permission: 
Permission is required for interchange registration during the add/drop period only.
http://www.smith.edu/catalog/
Schedule #: 
20379-F14

Course Sections

THEORETICAL FOUNDATIONS/CSC
Sect # Credits Instructor(s) Instructor Email Meeting Times Location
01 4.0 Alicia Wolfe apwolfe@smith.edu MWF 10:00-10:50 FORD 241