Computer Science 250 - THEORY OF COMPUTATION
Spring
2016
01
4.00
Joseph O'Rourke
MWF 10:00-10:50
Smith College
41381-S16
FORD 240
orourke@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.