Regular Languages are Context-Free & More! (Theory of Computing)
3Today we explore some relationships between context-free languages and regular languages. We finally address the question of where regular languages fit within the context-free languages, and if there are grammars that describe them!
Time Stamps:
0:00 Recap
2:50 Every regular languages is context-free (sketch)
14:30 Regular grammars, and an example
23:30 There is a regular grammar that generates L if and only if L is regular
26:30 Remarks, discussion about linear languages and grammars too!
28:49 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: 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
#theoryofcomputation
#tcs