CMPS130: Computational Models
Course Basics
Class: Tu/Th, 1:30 - 3:05 PM
Location: Kresge 321
Instructor: C. (Sesh) Seshadhri (sesh@)
Office: E2-347A
Office hours: Tu, 11-12
TA 1: Thomas Schmitz (tschmitz)
Office: BE-119
Office hours: Thu, 4-6
TA 2: Devesh (ddevesh)
Office: BE-119
Office hours: Mo, 12-1. Thu, 10-11
Piazza: Piazza page
Course Description
This course is an introduction to the theory of computation. We will discuss finite state automata, regular languages,
context free grammars, Turing machines, undecidability, and the P vs NP question. The course is highly mathematical
and there will be much focus on mathematical rigor and theorem proving.
Course Textbook
Our primary textbook is
We will follow Introduction to Automata Theory, Languages, and Computation (Third Edition) by Hopcroft, Motwani, Ullman. An additional reference is Introduction to the Theory of Computation, 3rd edition by Sipser.
Course slides and additional handouts are available at the schedule.