|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We construct an NFA for R*; then summarize the algebra of regular expressions.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We introduce NFA - automata with ε-transitions
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This is the first video for the FP lecture on IO and Monads.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This is the second video on the FP lecture on IO and Monads.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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,…
Publisher
Liam Holligan Licence Type
All rights reserved Language
English Date Created
November 19th, 2020
|
|
We give a first definition of regular language as a language that is accepted by some FSM.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|