× Home Research Teaching Publications Outreach Services Resources People Contact

CSC2060: Theory of Computation

workAdditional Notes

⁃Dr Richard Gault's Notes

workMathematical Proofs

⁃Proof by Induction-1

workNFA

⁃Basics
⁃Examples-2

workPushdown Automata, CFG, CNF, Non-CFL, Turing Machines, Decidability, and Time Complexity

⁃Available through Canvas (Login required)