Search for tag: "inf1a"

119 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 introduction to computation informatics 1 computation and logic thing things clauses exam clause front karnaugh mistakes pc models cheque zeros gate bit circuit rules slide unit nb piece 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 introduction to computation informatics 1 computation and logic 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 introduction to computation informatics 1 computation and logic things ways syllogisms diagram thing lines rule arrows times side aristotle problem answer valuations satisfies cycle 's assumption questions logic From Haoran Peng 0 likes 148 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 introduction to computation informatics 1 computation and logic rules machine things star friend proof language relation thing string solution theorem rule expression comma languages start sets words sigma From Haoran Peng 0 likes 213 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 informatics 1 introduction to computation haskell functional programming types proof thing logic term pair function rule curry programme lambda idea calculus introduction milner From Claudia-Elena Chirita 0 likes 420 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 computation and logic informatics 1 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 introduction to computation informatics 1 computation and logic 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 introduction to computation informatics 1 computation and logic machine epsilon transitions transition epsilons string start dfa table lights numbers machines haskell diagram thing things character hole place picture 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 introduction to computation informatics 1 computation and logic string epsilon expressions things language match thing unit sum matches star expression times concatenation alternation numbers strings names algebra r. 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 introduction to computation informatics 1 computation and logic string epsilon machine transitions star start epsilons things idea 's machines s. construction strings characters rules pieces trick bias recognise 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 introduction to computation informatics 1 computation and logic epsilon machine star language iteration sequencing epsilons strings symbol string rule moment a. surveys sequence problem languages silo efa recognisable 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 introduction to computation informatics 1 computation and logic machine word words epsilon language mfa machines bits fsm transitions dfa string rule start examples dice trace sets components equivalent From Haoran Peng 0 likes 280 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
FP - Lecture 17 - IO and Monads duration 46 minutes 18 seconds FP - Lecture 17 - IO and Monads FP - Lecture 17 - IO and Monads	FP - Lecture 17 - IO and Monads This is the first video for the FP lecture on IO and Monads. inf1a introduction to computation haskell functional programming command thing things char function question mark string lambda computer mind monad io a. input unit questions monoid lot From Claudia-Elena Chirita 0 likes 362 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 informatics 1 introduction to computation functional programming haskell io and monads monads monad things thing string question function a. questions guard lists return idea result computer parser coin character equations b. 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 introduction to computation informatics 1 computation and logic machine machines languages language dfa intersection union string arrows light lights row column pair pairs sequence things transitions end construction From Haoran Peng 0 likes 348 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 introduction to computation informatics 1 computation and logic machine light language machines transition complement symbols character lights operation sequences transitions alphabet complementation mba sigma remainder automaton dfa table From Haoran Peng 0 likes 371 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English