Context-Free Grammars and Languages II

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


Duration: 1:56:28
10 views
1

In today's lecture we explore more about context-free grammars and languages. We design some context-free grammars, see a relationship between grammars and regular languages (in the context of context-free languages), and the concept of ambiguity.

Time Stamps:
0:00 Preshow
36:40 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

#formallanguages
#computerscience
#theoryofcomputation



Other Videos By PageWizard Games, Learning & Entertainment


2023-04-24Language with More 0s Before Less 1s is not Regular (Theory of Computing)
2023-04-21Dan Plays Chrono Trigger (April 20, 2023)
2023-04-21Language of Palindromic Strings is not Regular (Theory of Computing)
2023-04-19Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing)
2023-04-19It's Poppin' Time!
2023-04-19Pushdown Automata
2023-04-17Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing)
2023-04-14Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography)
2023-04-14Dan Plays Chrono Trigger (April 13, 2023)
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))


Tags:
cfgs
ambig
regular
CS