Regular Expressions + GNFA Method (NFA to Regex Conversion) | ToC 2019 Lecture #4

Full Theory of Computation Lecture playlist: https://www.youtube.com/watch?v=OPaB-rpKhZ0&list=PLylTVsqZiRXMiTARmrsxCWU2RahyKB_Ae&index=1&t=1s Lecture "a la carte" playlist: https://www.youtube.com/watch?v=gO9Ho9Dpu8k&list=PLylTVsqZiRXP51EfJWv8cxD6wIFTZQD9_&index=1

Here we introduce regular expressions, an alternative model for the regular languages, as well as the GNFA method to be able to convert from any NFA into an equivalent regular expression.

Timeline: 0:00 - Intro 29:00 - Regular Expression Definition 34:00 - Conversion of Regex to NFA 43:05 - Regex to NFA Example 52:55 - NFA to Regex Conversion (GNFA Method) 1:16:35 - NFA to Regex Example

Easy Theory Website: https://www.easytheory.org Become a member: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg/join 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

▶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=zvREOgUbuPg