Search for tag: "machines"

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 88 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 103 plays 0  

CL - 15c - Introducing ε-transitions

We introduce NFA - automata with ε-transitions

From  Haoran Peng on November 23rd, 2020 0 likes 114 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 129 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 153 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 118 plays 0  

CL - 13a - Machines

This video introduces the notion of a machine.

From  Claudia-Elena Chirita on November 20th, 2020 0 likes 141 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 256 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 215 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 312 plays 0  

Kaltura Capture recording - November 5th 2020, 10:56:35 pm

lecture 8 part 2

From  Pauline Phemister on November 5th, 2020 0 likes 9 plays 0  

How 'Theo' Williamson FRS Changed the Sound of Music - IMechE Presidential Address of Professor Joe McGeough

IMechE Presidential Address of Professor Joe McGeough, FRSE, FRENG, FIMechE, President of the Institution of Mechanical Engineers 6.30pm on Thursday, 5 March 2020 Swann Lecture Theatre, Michael…

From  Billy Rosendale on November 5th, 2020 0 likes 10 plays 0  

How 'Theo' Williamson FRS Changed the Sound of Music - IMechE Presidential Address of Professor Joe McGeough (MP3 Audio only)

IMechE Presidential Address of Professor Joe McGeough, FRSE, FRENG, FIMechE, President of the Institution of Mechanical Engineers 6.30pm on Thursday, 5 March 2020 Swann Lecture Theatre, Michael…

From  Billy Rosendale on November 4th, 2020 0 likes 0 plays 0  

CL - Lecture 0

This is the introductory lecture to Computation and Logic, part of Inf1A - Introduction to Computation [2020/2021]. Before getting down to business, there are a few general points to be made about…

From  Claudia-Elena Chirita on September 3rd, 2020 1 likes 449 plays 0  

1.0 LCIintrolec

intro video

From  Paul Schweizer on September 2nd, 2020 0 likes 67 plays 0  

2.1-part2: Complement, union, intersection

.

From  Vesselin Velichkov on July 19th, 2020 1 likes 122 plays 1