The CYK Algorithm: How does it work? Dynamic Programming!

Here we look at the infamous CYK algorithm, which is to determine whether or not a context-free grammar (CFG) can generate a string or not. We heavily use the fact that any CFG can be converted into chomsky normal form (CNF), and that we can "build up" a string using many subproblems and scanning through the rules of the grammar. For more information about CFGs and CNF, check out the following playlists:

Context-Free Grammars: https://www.youtube.com/watch?v=h1OSmLSacNA&list=PLylTVsqZiRXOlDr8PemE5hUTVMGZrLD7G Chomsky Normal Form: https://www.youtube.com/watch?v=lEsDll4Um7Y&list=PLylTVsqZiRXOKoXo8oPwU3Z3RITt3sb05

Easy Theory Website: https://www.easytheory.org Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Youtube Live Streaming (Sundays) - subscribe for when these occur.

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

Gold Supporters: Micah Wood Silver Supporters: Timmy Gy

▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com

▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes. ... https://www.youtube.com/watch?v=N8d4kkfxM-s