Search for tag: "informatics 1"

115 Media

CL - 22 - Tseytin Satisfaction DPLL duration 53 minutes 47 seconds CL - 22 - Tseytin Satisfaction DPLL CL - 22 - Tseytin Satisfaction DPLL	CL - 22 - Tseytin Satisfaction DPLL N/A inf1a +23 More From Haoran Peng 0 likes 108 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 21 - CNF KM Gentzen Tseytin duration 50 minutes 26 seconds CL - 21 - CNF KM Gentzen Tseytin CL - 21 - CNF KM Gentzen Tseytin	CL - 21 - CNF KM Gentzen Tseytin N/A inf1a +3 More From Haoran Peng 0 likes 126 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 20 - syllogisms arrowrule duration 53 minutes 56 seconds CL - 20 - syllogisms arrowrule CL - 20 - syllogisms arrowrule	CL - 20 - syllogisms arrowrule N/A inf1a +23 More From Haoran Peng 0 likes 149 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 18 - rules duration 55 minutes 1 second CL - 18 - rules CL - 18 - rules	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… inf1a +23 More From Haoran Peng 0 likes 214 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
FP - Lecture 19 - Propositions as Types duration 37 minutes 11 seconds FP - Lecture 19 - Propositions as Types FP - Lecture 19 - Propositions as Types	FP - Lecture 19 - Propositions as Types This is the last FP video lecture, on Propositions as Types. inf1a +19 More From Claudia-Elena Chirita 0 likes 428 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 19 - regex DFA NFA duration 54 minutes 51 seconds CL - 19 - regex DFA NFA CL - 19 - regex DFA NFA	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. inf1a +2 More From Haoran Peng 0 likes 214 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 17 - regex: Arden's lemma duration 55 minutes 1 second CL - 17 - regex: Arden's lemma CL - 17 - regex: Arden's lemma	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. inf1a +3 More From Haoran Peng 0 likes 232 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 16 - ε-transitions and the subset… duration 49 minutes 40 seconds CL - 16 - ε-transitions and the subset… CL - 16 - ε-transitions and the subset construction	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. inf1a +23 More From Haoran Peng 0 likes 235 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15f - R* -- Iteration duration 2 minutes 48 seconds CL - 15f - R* -- Iteration CL - 15f - R* -- Iteration	CL - 15f - R* -- Iteration We construct an NFA for R*; then summarize the algebra of regular expressions. inf1a +23 More From Haoran Peng 0 likes 232 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15e - RS -- Concatenation duration 5 minutes 47 seconds CL - 15e - RS -- Concatenation CL - 15e - RS -- Concatenation	CL - 15e - RS -- Concatenation We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges. inf1a +23 More From Haoran Peng 0 likes 261 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15d - Using ε-transitions duration 2 minutes 2 seconds CL - 15d - Using ε-transitions CL - 15d - Using ε-transitions	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. inf1a +23 More From Haoran Peng 0 likes 248 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15c - Introducing ε-transitions duration 6 minutes 9 seconds CL - 15c - Introducing ε-transitions CL - 15c - Introducing ε-transitions	CL - 15c - Introducing ε-transitions We introduce NFA - automata with ε-transitions inf1a +23 More From Haoran Peng 0 likes 280 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
FP - Lecture 18 - IO and Monads duration 47 minutes 13 seconds FP - Lecture 18 - IO and Monads FP - Lecture 18 - IO and Monads	FP - Lecture 18 - IO and Monads This is the second video on the FP lecture on IO and Monads. inf1a +25 More From Claudia-Elena Chirita 0 likes 278 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15b - Boolean operations on DFA-Regular… duration 11 minutes 48 seconds CL - 15b - Boolean operations on DFA-Regular… CL - 15b - Boolean operations on DFA-Regular Languages	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. inf1a +23 More From Haoran Peng 0 likes 349 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 15a - Regular Languages (III) : DFA-regular duration 5 minutes 34 seconds CL - 15a - Regular Languages (III) : DFA-regular CL - 15a - Regular Languages (III) : DFA-regular	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. inf1a +23 More From Haoran Peng 0 likes 371 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
CL - 14e - DFA (II) duration 5 minutes 12 seconds CL - 14e - DFA (II) CL - 14e - DFA (II)	CL - 14e - DFA (II) We look at the representation of DFA in Haskell (using lists to represent the sets of the formal definition).In this video the code isDFA is defining what counts as a DFA when we use the black-hole… inf1a +23 More From Haoran Peng 0 likes 189 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English