Conversion of NFA to Regex PROOF (GNFA Method)

Here we show how to convert any NFA into an equivalent regex, called the "GNFA Method". This idea "rips" states out of an NFA until we get down to a two-state "NFA" with a single regex on the only transition (from the single start state to the single final state). An NFA cannot have a regex on the transition, so we define a "generalized" NFA (GNFA) which does allow them. Then the ripping states part becomes easy, as explained in the video.

#easytheory #nfa #dfa #gate #gateconcept #theoryofcomputing #turingmachine #nfatoregex #cfg #pda #undecidable #ricestheorem

Contribute: Paypal: https://paypal.me/easytheory Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Live Streaming (Sundays 2PM GMT, 2 hours): Twitch: https://www.twitch.tv/easytheory (Youtube also)

Social Media: Facebook Page: https://www.facebook.com/easytheory/ Facebook group: https://www.facebook.com/groups/easytheory/ Twitter: https://twitter.com/EasyTheory

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

▶ADDITIONAL QUESTIONS◀

1. Can we add the "empty set" transitions involving the start and final state?
2. Is there a way to rip states while maintaining the original final states as being final?

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