24:03

"We Are Doing 2nd and 3rd Reading Tonight!" RM of Springfield Council Meeting, Dec 17, 2024

04:25

"Don't Leave People Behind." RM of Springfield, Council Meeting, Dec 17, 2024

02:15

"What's the Difference Between 2nd & 3rd Reading?" RM of Springfield, Council Meeting, Dec 17, 2024

01:53

"Has All of Council Read the By-Law?"(Short Version) RM of Springfield, Council Meeting Dec 17, 2024

08:43

"Has All of Council Read the By-Law?" RM of Springfield, Council Meeting, Dec 17, 2024

28:33

Concerning Matters: RM of Springfield November 19, 2024 (Agenda Approvals, Question Period)

01:00

Mayor Therrien Yells at Resident of the RM of Springfield, Council Meeting, September 17, 2024

12:33

"How Does Removing Question Time Best Serve Us?" RM of Springfield, Council Meeting, Dec 17, 2024

04:49

The Last Question of the Last Question Period: RM of Springfield, Council Meeting Dec 17, 2024.

03:21:29

A Darkest Day in the RM of Springfield - Procedure By-Law 24-10, Council Meeting, December 17, 2024

23:11

Dr. Page's Presentation to RM of Springfield Council on Procedure By-Law, December 17, 2024

02:16

Frances Widdowson: A Hope for a Reckoning in Canadian Universities

11:59

Dr. Page's Presentation to RM of Springfield Council on Charter Rights Concerns, September 17, 2024

11:18

Updates - July 2024 [Welcome Back!]

01:24:28

Inclusion Through Exclusion: The Culling of Academics in Canadian Universities

20:01

Introduction to Debugging (Python)

03:31

Let's Make Something New! (Spring/Summer 2023 Updates)

11:07

Designing Pushdown Automata (Theory of Computing)

32:58

Instantaneous Descriptions, Language of a Pushdown Automaton (Theory of Computing)

22:08

Representing Pushdown Automata (Basic Example) [Theory of Computing]

43:08

Introduction to Pushdown Automata (Theory of Computing)

29:09

Regular Languages are Context-Free & More! (Theory of Computing)

15:34

Designing Context-Free Grammars III (Theory of Computing)

10:10

Designing Context-Free Grammars II (Theory of Computing)

23:44

Designing Context-Free Grammars I (Theory of Computing)

33:19

Proving a Context-Free Grammar is Correct (Theory of Computing)

01:09:20

Introduction to Context-Free Grammars and Languages (Theory of Computing)

17:59

Testing Set Membership and Equality of Regular Languages (Theory of Computing)

15:46

Testing Emptiness of a Regular Language (Theory of Computing)

12:03

Reversal of a Regular Language is Regular (Theory of Computing)

10:55

Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing)

16:59

Complement is Closed for Regular Languages (Theory of Computing)

13:09

Non-Regular Language with Equal Sums and More! (Theory of Computing)

09:39

Language with More 0s Before Less 1s is not Regular (Theory of Computing)

14:34

Language of Palindromic Strings is not Regular (Theory of Computing)

15:56

Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing)

36:05

Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing)

19:51

Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography)

39:38

Shift Cipher (Introductory Cryptography)

41:23

Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography)

23:14

Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation)

29:54

The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing)

27:54

Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing)

16:53

Algebraic Laws of Regular Expressions and More! (Theory of Computing)

30:11

Applying Kleene's DFA to Regex Construction (Theory of Computing)

01:02:34

Converting DFAs/NFAs to Regular Expressions - Kleene's Construction (Kleene's Theorem (Part 2))

02:00

The State of Academic Freedom in Canada

49:03

Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1))

01:12:55

Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing)

36:25

What are Regular Expressions? (Theory of Computing)

30:54

Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing]

23:15

How Do ε-NFAs Work? ε-Closures & More! (Theory of Computing)

27:09

What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing)

21:28

Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing)

22:46

Proving the Correctness of the Subset Construction (Theory of Computing)

16:28

Applying the Lazy Subset Construction for NFAs (to DFAs) [Theory of Computing]

16:53

Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing]

41:45

Subset Construction: NFAs to DFAs (Theory of Computing)

01:00:45

Proving NFAs are Correct via State Invariants (Theory of Computing)

18:50

Designing Nondeterministic Finite Automata (Theory of Computing)