Search for tag: "string"

32 Media

54:25 2 June 2021 Jonathan Brundan - Heisenberg actions… 2 June 2021 Jonathan Brundan - Heisenberg actions on Abelian categories	2 June 2021 Jonathan Brundan - Heisenberg actions on Abelian categories The subtitles/captions on this talk are being edited. They will be available within 2 weeks of the talk being published. 2 June 2021 Jonathan Brundan - Heisenberg actions on Abelian categories I… repnet representation theory combinatorics group theory category heisenberg partition representations morphism algebra function ring functions bubble induction action object kind power series relation categories string endomorphism From OLLIE Quinn on June 3rd, 2021 0 likes 31 plays 0 Licence Type All rights reserved Language English Date Created June 2nd, 2021
48:14 BMC BAMC 2021 Colva M. Roney-Dougal BMC BAMC 2021 Colva M. Roney-Dougal	BMC BAMC 2021 Colva M. Roney-Dougal 6-9 April 2021, BMC BAMC 2021 This talk was a BMC morning lecture by Colva M. Roney-Dougal (University of Saint Andrews) Titled: Finite Simple Groups and Computational Complexity This recording is… bmc bamc 2021 roney-dougal icms maths mathematics math computational complexity finite simple groups points problem base size subgroup permutation isomorphism things alpha point groups subsets element permutations omega elements thing log bit string From Sophia Martin on April 27th, 2021 0 likes 26 plays 0 Licence Type All rights reserved Language English Date Created April 6th, 2021
50:54 BMC BAMC 2021 Nathalie Wahl BMC BAMC 2021 Nathalie Wahl	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… strings wahl mathematics icms bmc bamc 2021 bmc bamc solution manifolds theory fact homology loop space cross class intersection manifold diagonal neighbourhood loops evaluation classes topology string geodesics equivalence boundary delta m. geodesic From Anna Munro on April 21st, 2021 0 likes 30 plays 0 Licence Type All rights reserved Language English Date Created April 7th, 2021
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 205 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 227 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 227 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 256 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 240 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 269 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 319 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 264 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 307 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 164 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 158 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 36 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

Search for tag: "string"

the university of edinburgh