Search for tag: "strings"

51 Media

01:25:00 ECS20 - W22 - Lecture 17 (9T): Counting 2 ECS20 - W22 - Lecture 17 (9T): Counting 2	ECS20 - W22 - Lecture 17 (9T): Counting 2 Lecture 2022-03-01. Review of counting principles. Then, another day of examples, these leading to probability calculations. times ways balls numbers cards probability universe factorial elements strings subsets log answer length From Phil Rogaway 0 likes 71 plays 0
01:24:59 ECS20 - W22 - Lecture 11 (6T): Relations and… ECS20 - W22 - Lecture 11 (6T): Relations and Functions 3	ECS20 - W22 - Lecture 11 (6T): Relations and Functions 3 Lecture 2022-02-08. Equinumerous sets. Another proof that the rationals are countable. Uncountability of the set of all languages over {0,1}. When do things become impractical? Concrete dividing… numbers language sets languages functions string strings cardinality asymptotics big-o theta upper-bound constant From Phil Rogaway 0 likes 104 plays 0
01:24:59 ECS20 - W22 - Lecture 10 (5R): Relations and… ECS20 - W22 - Lecture 10 (5R): Relations and Functions 2	ECS20 - W22 - Lecture 10 (5R): Relations and Functions 2 Injective, surjective, and bijective functions. Examples. Two methods to shuffle cards. Countably infinite sets. function domain cards numbers strings points permutation sets card integers bits codomain table image range From Phil Rogaway 0 likes 103 plays 0
01:25:00 ECS20 - W22 - Lecture 9 (5T): Relations and… ECS20 - W22 - Lecture 9 (5T): Relations and Functions 1	ECS20 - W22 - Lecture 9 (5T): Relations and Functions 1 ECS-020 Lecture 2022-02-01. Reviewing definitions. Equivalence relations and the idea that they induce partitions. Three ways of conceptualizing integers mod n. Functions. Computing functions that… relation strings function block equivalence blocks point integers length kind mod thing things functions characters string elements numbers integer From Phil Rogaway 0 likes 131 plays 0
01:20:53 ECS20 - W22 - Lecture 8 (4R): Sets 3 ECS20 - W22 - Lecture 8 (4R): Sets 3	ECS20 - W22 - Lecture 8 (4R): Sets 3 Review of strings and languages. Closing a set of languages using some operators. Regular languages. Examples. BYTE, WORD32, and WORD64 as languages computers "like", and how we… strings languages union concatenation star kleene closure bytes words unsigned integers floating point numbers float32 float64 ieee 754 ieee floating point standard relations string language numbers sets relation representation From Phil Rogaway 0 likes 85 plays 0
01:21:17 ECS20 - W22 - Lecture 7 (4T): Sets 2 ECS20 - W22 - Lecture 7 (4T): Sets 2	ECS20 - W22 - Lecture 7 (4T): Sets 2 More about sets. Powerset of a set. Cross product of sets. The axiomatic approach to set theory. Languages (sets of strings). sets langauges powerset cross product kleene closure regular language string strings language cross alphabet languages power characters elements length element things comma operator thing b. axioms theory numbers From Phil Rogaway 0 likes 111 plays 0
06:04 ECS 120 5b:4 a non-regular unary language ECS 120 5b:4 a non-regular unary language	ECS 120 5b:4 a non-regular unary language square string length energy extension language 2k 1s g. squares strings claim json distance thing spending copies expression integer cancel From David Doty 0 likes 110 plays 0
10:30 ECS 120 5b:3 more examples of using Myhill-Nerode… ECS 120 5b:3 more examples of using Myhill-Nerode Theorem	ECS 120 5b:3 more examples of using Myhill-Nerode Theorem string zeros language extension strings times k. pair eye bunch generality loss epsilon half form numbers condition i. d. extinction From David Doty 0 likes 178 plays 0
04:39 ECS 120 5b:2 proof of non-regularity using… ECS 120 5b:2 proof of non-regularity using closure properties	ECS 120 5b:2 proof of non-regularity using closure properties integer language zeros star closure proof bunch strings integers fact properties technique string c. languages addition x. numbers component analogy From David Doty 0 likes 98 plays 0
06:12 ECS 120 5b:1 examples of using the Myhill-Nerode… ECS 120 5b:1 examples of using the Myhill-Nerode Theorem	ECS 120 5b:1 examples of using the Myhill-Nerode Theorem I forgot to write on this slide that this is Section 7.7 in the lecture notes. strings language zeros extension theorem string proof pair fact form eye languages examples thing lengths end lots chain result wounds From David Doty 0 likes 397 plays 0
07:19 ECS 120 5a:5 corollary of Myhill-Nerode Theorem… ECS 120 5a:5 corollary of Myhill-Nerode Theorem we use and its proof	ECS 120 5a:5 corollary of Myhill-Nerode Theorem we use and its proof delta hat equivalence classes dfa l. corollary point sequence strings notation input sigma contrapositive language d. cardinality class string extension From David Doty 0 likes 113 plays 0
03:53 ECS 120 5a:4 statement of Myhill-Nerode Theorem ECS 120 5a:4 statement of Myhill-Nerode Theorem	ECS 120 5a:4 statement of Myhill-Nerode Theorem equivalence classes relation fact respect key b. string strings language dfa road myelin theorem reason extension eye argument zeros end From David Doty 0 likes 148 plays 0
04:24 ECS 120 5a:3 example of separating extension ECS 120 5a:3 example of separating extension	ECS 120 5a:3 example of separating extension extension zeros b. strings language star bunch question form equivalence ways entity end function direction regard bonds epsilon concept From David Doty 0 likes 119 plays 0
04:16 ECS 120 5a:2 definition of separating extension… ECS 120 5a:2 definition of separating extension and L-equivalence	ECS 120 5a:2 definition of separating extension and L-equivalence extension strings star negation words definition l. sigma language owl exists expansion sim attack symbol y. sin alcohol conditions thing From David Doty 0 likes 113 plays 0
12:25 ECS 120 0:7 combinatorics (discrete math review) ECS 120 0:7 combinatorics (discrete math review)	ECS 120 0:7 combinatorics (discrete math review) length strings ways times string elements n. element pants subsets bit shirts combinatorics sequence rule subset children power outfits permutations From David Doty 1 likes 265 plays 0
09:25 ECS 220 5b:6.6-4 two lemmas and full proof of… ECS 220 5b:6.6-4 two lemmas and full proof of Ladner_s theorem	ECS 220 5b:6.6-4 two lemmas and full proof of Ladner_s theorem clique strings statement stage steps qi a. y. problem length lemma string input table answer statements language conditions condition return From David Doty 0 likes 20 plays 0