Archive - COMP218
2021
-
Dec 09
The Chomsky Hierarchy -COMP218 -
Dec 09
Undecidability of CFG Ambiguity -COMP218 -
Dec 03
Undecidable Problems for CFGs -COMP218 -
Dec 03
Reducability -COMP218 -
Nov 27
Unrecognisable Languages -COMP218 -
Nov 27
Turing's Theorem -COMP218 -
Nov 27
Universal Turing Machines & Undecidability -COMP218 -
Nov 26
Decidable & Undecidable Languages -COMP218 -
Nov 26
Running Time (P vs NP) -COMP218 -
Nov 26
Random Access Machines -COMP218 -
Nov 26
Variants of Turing Machines -COMP218 -
Nov 22
Programming Turing Machines -COMP218 -
Nov 22
Turing Machines -COMP218 -
Nov 19
Regular Closure of CFLs -COMP218 -
Nov 19
Closure Properties of Context-Free Languages -COMP218 -
Nov 19
Pumping Lemma for GFGs -COMP218 -
Nov 18
COMP218 - PDA to CFG Conversion -COMP218 -
Nov 17
CFG to PDA Conversions -COMP218 -
Nov 15
Pushdown Automata -COMP218 -
Nov 15
Probabilistic CFGs -COMP218 -
Nov 05
Cocke-Younger-Kasami (CYK) Algorithm -COMP218 -
Nov 05
Chomsky Normal Form -COMP218 -
Nov 05
Parsing Context Free Grammars -COMP218 -
Nov 05
Context Free Grammar Ambiguity -COMP218 -
Nov 05
Context-Free vs. Regular Languages -COMP218 -
Nov 05
Context-Free Grammars -COMP218 -
Oct 28
Context-Free Languages -COMP218 -
Oct 22
Translation of DFA to Regular Expressions -COMP218 -
Oct 21
Why DFA Minimisation Works -COMP218 -
Oct 21
DFA Minimisation General Algorithm -COMP218 -
Oct 21
DFA Minimisation -COMP218 -
Oct 21
Pumping Lemma Game -COMP218 -
Oct 21
Non-Regular Languages -COMP218 -
Oct 16
Decision & Closure Properties -COMP218 -
Oct 16
$\epsilon$-NFA to Regex Translation -COMP218 -
Oct 15
Regular Expressions & Translation of Regex to NFA -COMP218 -
Oct 15
Regex to $\epsilon$-NFA Conversion -COMP218 -
Oct 08
Non-Deterministic Finite Automatons (NFAs) -COMP218 -
Oct 08
Analysing Regular Expressions -COMP218 -
Oct 06
Definition of Regular Expressions -COMP218 -
Oct 06
$\epsilon$-NFA to NFA Conversion -COMP218 -
Oct 04
NFA to DFA Conversion (Determinisation) -COMP218 -
Oct 01
Set Theory, Kleene Star & DNF -COMP218 -
Oct 01
Nondeterministic Finite Automata (NFAs) & Epsilon-NFAs -COMP218 -
Sep 28
Deterministic Finite Automata (DFAs) -COMP218 -
Sep 27
Preliminaries of Automata Theory & Set Theory -COMP218 -
Sep 27
Module Overview & Automata Types -COMP218