Search for tag: "informatics"

Advanced Technology for Financial Computing MSc

Learn more about the Advanced Technology for Financial Computing MSc in this overview presentation from Programme Director, Dr Tiejun Ma. This new programme from the School of Informatics will…

From  Nicola Hopper on December 1st, 2020 0 likes 0 plays 0  

CL - 22 - Tseytin Satisfaction DPLL

N/A

From  Haoran Peng on December 1st, 2020 0 likes 6 plays 0  

CL - 21 - CNF KM Gentzen Tseytin

N/A

From  Haoran Peng on December 1st, 2020 0 likes 5 plays 0  

CL - 20 - syllogisms arrowrule

N/A

From  Haoran Peng on November 30th, 2020 0 likes 17 plays 0  

CL - 18 - rules

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.This lecture introduces a very important…

From  Haoran Peng on November 30th, 2020 0 likes 26 plays 0  

FP - Lecture 19 - Propositions as Types

This is the last FP video lecture, on Propositions as Types.

From  Claudia-Elena Chirita on November 29th, 2020 0 likes 110 plays 0  

CL - 19 - regex DFA NFA

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.

From  Haoran Peng on November 23rd, 2020 0 likes 198 plays 0  

CL - 17 - regex: Arden's lemma

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.

From  Haoran Peng on November 23rd, 2020 0 likes 213 plays 0  

CL - 16 - ε-transitions and the subset construction

This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.

From  Haoran Peng on November 23rd, 2020 0 likes 216 plays 0  

CL - 15f - R* -- Iteration

We construct an NFA for R*; then summarize the algebra of regular expressions.

From  Haoran Peng on November 23rd, 2020 0 likes 220 plays 0  

CL - 15e - RS -- Concatenation

We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.

From  Haoran Peng on November 23rd, 2020 0 likes 249 plays 0  

CL - 15d - Using ε-transitions

We present a first example of the use of ε-transitions to concstruct new mahines, and pose a problem to be answered in the following video.

From  Haoran Peng on November 23rd, 2020 0 likes 230 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng on November 23rd, 2020 0 likes 259 plays 0  

FP - Lecture 18 - IO and Monads

This is the second video on the FP lecture on IO and Monads.

From  Claudia-Elena Chirita on November 23rd, 2020 0 likes 236 plays 0  

CL - 15b - Boolean operations on DFA-Regular Languages

Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.

From  Haoran Peng on November 22nd, 2020 0 likes 292 plays 0  

CL - 15a - Regular Languages (III) : DFA-regular

Our third definition: we say a language is DFA-regular if it is the language recognised by some DFA.We show that the complement of a DFA-regular language is DFA-regular.

From  Haoran Peng on November 22nd, 2020 0 likes 331 plays 0