Search for tag: "strings"

BMC BAMC 2021 Nathalie Wahl

6-9 April, BMC BAMC 2021. This is the BMC Morning Talk by Nathalie Wahl (Copenhagen). Strings in Manifolds. This recording is subtitled. If you wish to remove the captions, click the CC button on…

From  Anna Munro on April 21st, 2021 0 likes 18 plays 0  

Distillation Lecture 2 2020 part 3

Distillation Lecture 2 2020 part 3

From  John Christy on December 30th, 2020 0 likes 38 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 227 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 256 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 240 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 158 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 31 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 295 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 - 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 367 plays 0  

IDS - Week 05 - 05 - Recoding data

Review of data import, data types, and classes with a case study involving recoding data

From  Mine Cetinkaya-Rundel on October 12th, 2020 0 likes 22 plays 0  

IDS - Week 04 - 02 - Data types

Data types and special values in R

From  Mine Cetinkaya-Rundel on October 12th, 2020 0 likes 53 plays 0