Computer Science 250 - THEORY OF COMPUTATION

Spring
2018
01
4.00
R. Jordan Crouser
TTh 09:00-10:20
Smith College
30427-S18
MCCONN 103
jcrouser@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