CSC 445 - Lecture Notes

Note: All the lecture notes on this page are based on the lecture notes by Adam Webber and are copyrighted.

Introduction & Foundations
Finite Automata & Regular Languages
Closure Properties of Regular Languages
Nondeterministic Finite Automata (NFA)
NFA Implementation, NFA/DFA conversion
Regular Expressions (handout)
Grammars
Non-Regular Languages
Context-Free Languages
Stack Machines
Non-Context-Free Languages
Turing Machines (TM examples)
Computability
Uncomputability Part 1
Computability Summary