Home

Schedule
  & Notes

Assignments

Syllabus

Overview: This course covers the foundations of theoretical com-puter science, and the topics to be covers include:

• Introduction to Theory of Computation
• Mathematical Notations and Terminology
• Finite Automata
• Nondeterminism
• Regular Expressions and Nonregular Languages
• Context-Free Grammars
• Pushdown Automata
• Non-Context-Free Languages
• Turing Machine and Variants
• Definition of Algorithm
• Decidability
• Reducibility
• Time Complexity
• Space Complexity

Instructor: Sanchuan Chen
       Department of Computer and Information Sciences
       schen409@fordham.edu

Class meeting time: Mon/Thu 4:00pm-5:15pm (Rose Hill)

Class meeting room: JMH 331 (Rose Hill)
Office hours: Mon/Thu 1-2pm (Rose Hill)

Class WWW site: https://storm.cis.fordham.edu/~schen409/courses/CISC4090_Spring2023/CISC4090.html

Course Materials:

• Textbook: Introduction to Theory of Computation, 3rd edition, Michael Sipser.