Texyland

Papers

• Summer 2012 - Paper - Solutions
• Summer 2016 - Paper - Solutions
• Summer 2022 - Paper - Solutions
• Resit 2022 - Paper
• Mock 2023 - Paper
• Summer 2023 - Paper - Solutions

Resources

• Revision topic list
• All handouts

2023 Continuous Assessment

• Formative 1 - Questions - Solutions
• Formative 2 - Questions - Solutions
• Summative 1 - Questions - Solutions
• Summative 2 - Questions - Solutions
• Summative 3 - Questions - Solutions

Videos

• DFAs, NFAs and determinising NFAs
• Checking for DFA equivalence
• Proofs by induction
• Regular expressions and minimal automata
• Context-free grammars
• Turing machines
• P, NP, NDTMs and Reduction
• Decidability, computability, semi-decidability, Church's Thesis
• Converting a regular expression to a total DFA
• Definition of NP
• Church's Thesis
• Minimizing a DFA
• Checking for DFA / language equivalence
• Introduction to decidability
• Regular expressions
• Undecidability, the Halting Problem and Problem Reduction
• Context-free grammars, ambiguity and Chomsky normal form
• Big-O Complexity Proofs