Regular Expressions I

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


Duration: 3:26:45
11 views
4

Let us explore another way of looking at regular languages, with regular expressions! These provide us a descriptive way of discussing regular languages, as opposed to the machine-oriented manner we have spoken about previously with finite automata.

Time Stamps:
0:00 Preshow
14:50 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

#regular
#theoryofcomputation
#formallanguages



Other Videos By PageWizard Games, Learning & Entertainment


2023-03-07Pumping Lemma for Regular Languages (Birthday Stream)
2023-03-06Applying the Lazy Subset Construction for NFAs (to DFAs) [Theory of Computing]
2023-03-03Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing]
2023-03-03Dan Plays Chrono Trigger (March 2, 2023)
2023-03-01Subset Construction: NFAs to DFAs (Theory of Computing)
2023-03-01Regular Expressions II (Regex to DFA - Kleene's Theorem (Part 2))
2023-02-27Proving NFAs are Correct via State Invariants (Theory of Computing)
2023-02-24Designing Nondeterministic Finite Automata (Theory of Computing)
2023-02-24Dan Plays Chrono Trigger (February 23, 2023)
2023-02-22Formal Definition of Computing for NFAs (Theory of Computing)
2023-02-22Regular Expressions I
2023-02-20What are Nondeterministic Finite Automata? [Theory of Computing]
2023-02-17Dan Plays Chrono Trigger (February 16, 2023)
2023-02-17Rows of Pascal's Triangle Sum to Powers of 2 (Mathematics for Computer Science)
2023-02-15Applying the Binomial Theorem (Mathematics for Computer Science)
2023-02-15Nondeterministic Finite Automata with Epsilon-Transitions
2023-02-13The Binomial Theorem (Mathematics for Computer Science)
2023-02-10Dan Plays Monster Hunter Rise: Sunbreak (February 9, 2023)
2023-02-10Properties of Pascal's Triangle (Mathematics for Computer Science)
2023-02-08Pascal's Triangle and Formula (Mathematics for Computer Science)
2023-02-08Equivalence of Deterministic and Nondeterministic Finite Automata