Regular Expressions -- Intro Theory of Computation Help Session #4

Here we introduce the notion of regular expressions as well as give examples. We also show how to convert from an NFA into a regex (otherwise known as the GNFA method), as well as how to convert a regex into an NFA. This was recorded on 6 February 2017.

Timeline: 0:00 - Intro 2:00 - Regular Expression Definition 5:40 - Regex to NFA Example 12:20 - NFA to Regex Example 1 28:00 - NFA to Regex Example 2

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

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=Of1uGwhRjug