Proving Languages are Not Regular (via Pumping Lemma)

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
780
Published on ● Video Link: https://www.youtube.com/watch?v=az78pregdAI


Duration: 2:30:34
11 views
0

Last time we explored automata theory we proved the pumping lemma and seen how we can use it to prove a language is not regular. Today we explore this more, with plenty of more examples!

Time Stamps:
0:00 Preshow
27:57 Lecture begins!

Fill out our form to learn more when we can help you learn computer science together live: https://forms.gle/ergL8FrbHuAHctF3A

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Eric R.
Patreon Supporters (Supporter Access!):
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: https://www.twitch.tv/pagewizard

#computerscience
#automata
#tcs



Other Videos By PageWizard Games, Learning & Entertainment


2023-04-01Dan Plays Chrono Trigger (March 31, 2023 - Part 2)
2023-04-01Dan Plays Chrono Trigger (March 31, 2023 - Part 1)
2023-03-31Algebraic Laws of Regular Expressions and More! (Theory of Computing)
2023-03-29Applying Kleene's DFA to Regex Construction (Theory of Computing)
2023-03-28Exploring Properties of Regular Languages
2023-03-27Converting DFAs/NFAs to Regular Expressions - Kleene's Construction (Kleene's Theorem (Part 2))
2023-03-26The State of Academic Freedom in Canada
2023-03-24Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1))
2023-03-23Dan Plays Chrono Trigger (March 23, 2023 - Technical Issues)
2023-03-22Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing)
2023-03-22Proving Languages are Not Regular (via Pumping Lemma)
2023-03-20What are Regular Expressions? (Theory of Computing)
2023-03-19Ms. Kitty Reacts to The Grapist
2023-03-17Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing]
2023-03-17Dan Plays Chrono Trigger (March 16, 2023)
2023-03-15How Do ε-NFAs Work? ε-Closures & More! (Theory of Computing)
2023-03-15Introduction to Cryptography
2023-03-13What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing)
2023-03-10Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing)
2023-03-10Dan Plays Chrono Trigger (March 9, 2023)
2023-03-08Proving the Correctness of the Subset Construction (Theory of Computing)


Tags:
regex
tcs
pumping lemma