Proving a Context-Free Grammar is Correct (Theory of Computing)
Previously we defined what a context-free grammar is. We proposed a grammar that generates all palindromic strings. Is it correct? Dr. Page discusses how we can prove its correctness, using the definition of the language for a context-free grammar! Check out how we use induction here!
Time Stamps:
0:00 Recap, a context-free grammar we want to prove correct
1:39 Gameplan
6:30 Proof (Part 1 - induction on the number of production rules applied)
23:20 Proof (Part 2 - induction on length of string)
32:59 Closing
Have a beautiful day!
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: / pagewizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: / danielrpage
TWITTER: / pagewizardgle
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: / pagewizard
#ComputerScience
#Algorithms
#DataStructures