Exploring Properties of Regular Languages

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


Duration: 2:06:42
15 views
2

In today's lecture, we explore more properties of regular languages. For example, we see if there are more operations we can do to regular languages that preserve them as regular languages. In addition, we see how we can test some properties regular languages may have!

Time Stamps:
0:00 Preshow
20:12 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

#regularlanguage
#computerscience
#automatatheory



Other Videos By PageWizard Games, Learning & Entertainment


2023-04-12Shift Cipher (Introductory Cryptography)
2023-04-11Context-Free Grammars and Languages II
2023-04-10Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography)
2023-04-07Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation)
2023-04-05The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing)
2023-04-03Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing)
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)