Regular Expressions (Regexes), what are they?
Easy Theory
Here we look at and define regular expressions, which allow us to describe, formally, what a language is. They are defined using three "base" cases (empty string, empty set, and a single character), and three "inductive" cases (union, concatenation, and star).
Contribute: 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
Gold Supporters: Anonymous (x1), Micah Wood, Ben Pritchard Silver Supporters: Timmy Gy Supporters: Yash Singhal
▶ADDITIONAL QUESTIONS◀
- What other operators can be included that can be achieved from union, concatenation, and star?
▶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 over 12 courses at two different universities, including several sections of undergraduate and graduate theory-level classes. ... https://www.youtube.com/watch?v=7phPFEMcfEs
22930483 Bytes