Search for tag: "string"

29 Media

55:01 CL - 18 - rules CL - 18 - rules	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… inf1a introduction to computation informatics 1 computation and logic rules machine things star friend proof language relation thing string solution theorem rule expression comma languages start sets words sigma From Haoran Peng on November 30th, 2020 0 likes 203 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
49:40 CL - 16 - ε-transitions and the subset… CL - 16 - ε-transitions and the subset construction	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. inf1a introduction to computation informatics 1 computation and logic machine epsilon transitions transition epsilons string start dfa table lights numbers machines haskell diagram thing things character hole place picture From Haoran Peng on November 23rd, 2020 0 likes 224 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
02:48 CL - 15f - R* -- Iteration CL - 15f - R* -- Iteration	CL - 15f - R* -- Iteration We construct an NFA for R*; then summarize the algebra of regular expressions. inf1a introduction to computation informatics 1 computation and logic string epsilon expressions things language match thing unit sum matches star expression times concatenation alternation numbers strings names algebra r. From Haoran Peng on November 23rd, 2020 0 likes 225 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
05:47 CL - 15e - RS -- Concatenation CL - 15e - RS -- Concatenation	CL - 15e - RS -- Concatenation We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges. inf1a introduction to computation informatics 1 computation and logic string epsilon machine transitions star start epsilons things idea 's machines s. construction strings characters rules pieces trick bias recognise From Haoran Peng on November 23rd, 2020 0 likes 254 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
02:02 CL - 15d - Using ε-transitions CL - 15d - Using ε-transitions	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. inf1a introduction to computation informatics 1 computation and logic epsilon machine star language iteration sequencing epsilons strings symbol string rule moment a. surveys sequence problem languages silo efa recognisable From Haoran Peng on November 23rd, 2020 0 likes 238 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
06:09 CL - 15c - Introducing ε-transitions CL - 15c - Introducing ε-transitions	CL - 15c - Introducing ε-transitions We introduce NFA - automata with ε-transitions inf1a introduction to computation informatics 1 computation and logic machine word words epsilon language mfa machines bits fsm transitions dfa string rule start examples dice trace sets components equivalent From Haoran Peng on November 23rd, 2020 0 likes 267 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
46:18 FP - Lecture 17 - IO and Monads FP - Lecture 17 - IO and Monads	FP - Lecture 17 - IO and Monads This is the first video for the FP lecture on IO and Monads. inf1a introduction to computation haskell functional programming command thing things char function question mark string lambda computer mind monad io a. input unit questions monoid lot From Claudia-Elena Chirita on November 23rd, 2020 0 likes 308 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
47:13 FP - Lecture 18 - IO and Monads FP - Lecture 18 - IO and Monads	FP - Lecture 18 - IO and Monads This is the second video on the FP lecture on IO and Monads. inf1a informatics 1 introduction to computation functional programming haskell io and monads monads monad things thing string question function a. questions guard lists return idea result computer parser coin character equations b. From Claudia-Elena Chirita on November 23rd, 2020 0 likes 256 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
11:48 CL - 15b - Boolean operations on DFA-Regular… CL - 15b - Boolean operations on DFA-Regular Languages	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. inf1a introduction to computation informatics 1 computation and logic machine machines languages language dfa intersection union string arrows light lights row column pair pairs sequence things transitions end construction From Haoran Peng on November 22nd, 2020 0 likes 305 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
05:12 CL - 14e - DFA (II) CL - 14e - DFA (II)	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… inf1a introduction to computation informatics 1 computation and logic hole transitions transition start dfa diagram arrow things q1 fsm convention string typing q. function q0 label beginning trace place From Haoran Peng on November 20th, 2020 0 likes 163 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
07:08 CL - 14d - Regular Languages (II) CL - 14d - Regular Languages (II)	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. inf1a introduction to computation informatics 1 computation and logic operation string things star strings sets rules operations definition languages thing rule concatenation induction form sense machines iteration words a2 From Haoran Peng on November 20th, 2020 0 likes 157 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
54:36 LMS Computer Science Colloquium - Igor Carboni… LMS Computer Science Colloquium - Igor Carboni Oliveira (Warwick)	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,… icms complexity string primes representations bit probability algorithm distribution strings numbers problem theorem log complex question class proof representation sequence theory From Liam Holligan on November 19th, 2020 0 likes 24 plays 0 Publisher Liam Holligan Licence Type All rights reserved Language English Date Created November 19th, 2020
04:19 CL - 14c - Regular Languages (I) CL - 14c - Regular Languages (I)	CL - 14c - Regular Languages (I) We give a first definition of regular language as a language that is accepted by some FSM. inf1a introduction to computation informatics 1 computation and logic string machine subset languages star sigma machines start 13th strings language union b. parallel character thing things sense definition expressions From Haoran Peng on November 18th, 2020 0 likes 255 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
03:04 CL - 14b - Machines in Haskell (II) CL - 14b - Machines in Haskell (II)	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… inf1a introduction to computation informatics 1 computation and logic fsm string transitions step place symbol start things urine rest character arrows symbols machine trace end run statuary stay record From Haoran Peng on November 18th, 2020 0 likes 269 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
09:34 CL - 13c - Machines in Haskell CL - 13c - Machines in Haskell	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… inf1a introduction to computation informatics 1 computation and logic machine transitions lights start string symbol symbols fsm function button definition wikipedia triples alphabet character arrow starting cue light transition From Haoran Peng on November 17th, 2020 0 likes 335 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
08:58 CL - 13b - regex and FSM CL - 13b - regex and FSM	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… inf1a introduction to computation informatics 1 computation and logic machine star strings language b. times machines expressions string parallel alphabet brackets a. circle bingo languages things parentheses expression alternation From Haoran Peng on November 17th, 2020 0 likes 366 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English

Search for tag: "string"

the university of edinburgh