Foundations of CS Theory
CSCI-661-01, Spring 2022, Semester 2215
building 70, room 3657,
TuTh 6:30pm-8pm in person or
zoom, or email firstname.lastname@example.org any time
Tuesday/Thursday 5:00pm-6:15pm, room 70-3445
- M. Sipser,
Introduction to the Theory of Computation,
Cengage Learning, third edition 2013, required textbook.
to various editions.
- John C. Martin,
Introduction to Languages and the Theory of Computation,
McGraw-Hill, fourth edition 2010, optional textbook.
- J.E. Hopcroft and J.D. Ullman,
Introduction to Automata Theory, Languages and Computation,
Addison-Wesley 1979, optional (math oriented, classics). Third edition,
J.E. Hopcroft, R. Motwani and J.D. Ullman, Addison-Wesley 2007.
25% Midterm Exam, Thursday, March 3, 2022, 5pm-6:15pm, room 70-3445.
30% Final Exam, Thursday, April 28, 2022, 7pm-9:30pm, room 70-3445.
Introduction to the classical and contemporary theory of computation
covering regular, context-free 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.
Overview, discrete mathematics:
lect4.pdf (week 2)
lect7.pdf (week 3)
lect9.pdf (week 4)
lect12.pdf (week 5, 2/7-11)
lect14.pdf (week 6, 2/14-18)
lect16.pdf (week 7, 2/21-25)
lect17.pdf (week 8: 3/1 class, 3/3 midterm)
(week 9, 3/14-18)
(week 10, 3/21-25)
(week 11, 3/28-31)
Church thesis, what can be computed?
(week 12, 4/4-8)
Decidability, solvability, computability, recursive functions
(week 13, 4/11-15)
(week 14, 4/18-22)
Extra help, both in-person and on zoom, is available at the
All general RIT
Educational Policies apply to this course.
All common CS course policies also apply. Ask when in doubt.