Search for tag: "string"

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 203 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 224 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 225 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 254 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 238 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng on November 23rd, 2020 0 likes 267 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 308 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 256 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 305 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 163 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 157 plays 0  

LMS Computer Science Colloquium - Igor Carboni Oliveira (Warwick)

An automated programme is used to generate the subtitles on this talk. You can remove the subtitles by pressing CC on the bottom toolbar. Igor Carboni Oliveira (Warwick) - Kolmogorov complexity,…

From  Liam Holligan on November 19th, 2020 0 likes 24 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 255 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 269 plays 0  

CL - 13c - Machines in Haskell

In this video we formalise the definition of an FSM, describe how a machine and its behaviour may be represented in Haskell.In this video we use lists to represent the sets used in the mathematical…

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

CL - 13b - regex and FSM

We introduce some simple finite state machines, and three key ideas of the theory.The first idea is that of the language recognised by a machine. Given an alphabet of symbols, a language is a set…

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