Foundations of CS Theory
CSCI66101, Spring 2024, Term 2235
Instructor
building 70, room 3657,
(585) 4755193
spr@cs.rit.edu,
https://www.cs.rit.edu/~spr
office hours:
TuTh 6:30pm8pm in person, or
via
zoom (must prearrange), or email spr@cs.rit.edu any time
Lectures
Tuesday/Thursday 5:00pm6:15pm, room 703435
Books
 M. Sipser,
Introduction to the Theory of Computation,
Cengage Learning, third edition 2013, required textbook.
Errata
to various editions.
 John C. Martin,
Introduction to Languages and the Theory of Computation,
McGrawHill, fourth edition 2010, optional textbook.
 J.E. Hopcroft and J.D. Ullman,
Introduction to Automata Theory, Languages and Computation,
AddisonWesley 1979, optional (math oriented, classics). Third edition,
J.E. Hopcroft, R. Motwani and J.D. Ullman, AddisonWesley 2007.
Evaluation

42% Homeworks

20% Midterm Exam, Thursday, March 7, 2024, 5pm6:15pm, room 703435.

26% Final Exam, Thursday, May 2, 2024, 7pm9:30pm, room 703435.

12% Class participation
Contents
Introduction to the classical and contemporary theory of computation
covering regular, contextfree and computable (recursive) languages
with finite state machines, pushdown automata and Turing machines.
Basis of the Chomsky hierarchy and computability theory. Overview
of main ideas of Complexity Theory and Computability Theory.
There are no programming assignments.
Schedule
To do. Done in Spring 2023
Tutoring
Extra help, both inperson and on zoom, is available at the
Tutoring Center.
Policies
All general RIT
Educational Policies apply to this course.
All common CS course policies also apply. Ask when in doubt.