Search for tag: "introduction to computation"

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 116 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 131 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 141 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 149 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 151 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

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

FP - Lecture 17 - IO and Monads

This is the first video for the FP lecture on IO and Monads.

From  Claudia-Elena Chirita on November 23rd, 2020 0 likes 129 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 94 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 188 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 223 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 on November 20th, 2020 0 likes 123 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 on November 20th, 2020 0 likes 120 plays 0  

CL - 13a - Machines

This video introduces the notion of a machine.

From  Claudia-Elena Chirita on November 20th, 2020 0 likes 143 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 on November 18th, 2020 0 likes 257 plays 0  

CL - 14c - Regular Languages (I)

We give a first definition of regular language as a language that is accepted by some FSM.

From  Haoran Peng on November 18th, 2020 0 likes 217 plays 0  

CL - 14b - Machines in Haskell (II)

In this video we present the formalisation of the accepts function in Haskell.In this video we use lists to represent the sets used in the mathematical definition. In the code for tutorials we use…

From  Haoran Peng on November 18th, 2020 0 likes 239 plays 0