CSCI 356/541: Theory of Computing (Fall 2026)

Course Description

An introduction to the theoretical foundations of computer science, examining finite automata, context-free grammars, Turing machines, decidability and undecidability, and complexity theory. Strategies will be developed to help categorize problems as tractable or intractable.

See the course outline for more information.

Course Details

Lecture Time/Place

Monday, 1:30pm–2:20pm; Wednesday, 12:30pm–1:20pm; Friday, 11:30am–12:20pm

All lectures are held in the Annex, room 23A.

Textbook

Required text: T. J. Smith, Theory of Computing: An Open Introduction. Self-published open educational resource, α pre-publication edition, 2024.

Recommended text: M. Sipser, Introduction to the Theory of Computation. Cengage, 3rd edition, 2012.

The required course textbook includes all material that will be discussed in each lecture. The recommended course textbook can be used as an optional supplement.

Marking Scheme

You must write the final examination in order to pass the course, even if the weighted sum of your assignment and midterm examination grades is at least 50%.

News

Lectures

Week Notes Readings
1 Introduction, regular expressions TOCOpen, 1.1
2 Finite automata, nondeterminism TOCOpen, 1.2

Assignments

Assignments are due at the beginning of class on the due date. Late assignments will be accepted up to the beginning of the first class following the due date. Late assignments are subject to a penalty of 10% deducted from the earned mark.

Exams

Midterm

Date: Oct. 30, 2026
Time: 11:30am–12:20pm
Place: Annex, Room 23A
Content: All material from Weeks 1 to 6

Personnel

Instructor

Taylor J. Smith
Email: tjsmith [at] stfx [dot] ca
Office: Annex, Room 9A
Office hours: Monday 11:30am–1:20pm/Wednesday 10:30am–12:20am/Friday 9:30am–11:20am, or by appointment