Search for tag: "computation and logic"

CL - 22 - Tseytin Satisfaction DPLL

N/A

From  Haoran Peng 0 likes 107 plays 0  

CL - 21 - CNF KM Gentzen Tseytin

N/A

From  Haoran Peng 0 likes 126 plays 0  

CL - 20 - syllogisms arrowrule

N/A

From  Haoran Peng 0 likes 147 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 0 likes 212 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 0 likes 214 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 0 likes 231 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 0 likes 235 plays 0  

CL - 15f - R* -- Iteration

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

From  Haoran Peng 0 likes 232 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 0 likes 261 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 0 likes 247 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng 0 likes 280 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 0 likes 347 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 0 likes 366 plays 0  

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…

From  Haoran Peng 0 likes 189 plays 0  

CL - 14d - Regular Languages (II)

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

From  Haoran Peng 0 likes 169 plays 0  

CL - 13d - Black holes and DFA

We begin with a short discussion of the history and some applications of FSM. We then introduce Deterministic Finit-state Automata (DFA), and the use of the black hole convention when presenting…

From  Haoran Peng 0 likes 315 plays 0