What are Regular Expressions? (Theory of Computing)

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


Duration: 36:25
20 views
3

Today we move onto talking about regular expressions, a descriptive way of talking about regular languages (as opposed to the machine-oriented way we have been describing them). We see what the formal definition is, then see how we can apply them in a basic scenario!

Time Stamps:
0:00 Opening, summary of concept versus previous explorations with automata
7:35 Definition of a regular expression
24:48 Order of operations for regular operators in regular expressions.
28:33 Example (regex for all binary strings, and more)
36:05 Closing

Have a beautiful day!

Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
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
PAYPAL: https://paypal.me/pagewizard

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

#ComputerScience
#regex
#theoryofcomputation



Other Videos By PageWizard Games, Learning & Entertainment


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)
2023-03-07Pumping Lemma for Regular Languages (Birthday Stream)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
regex
regular expression
regexp
grep
theory of computing
computation
regular languages
automata theory
formal language theory