Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing)

Today we consider numerous examples of designs for regular expressions! We walk through several standards types of designs for regular expressions. Time Stamps: 0:00 Recap 1:10 Example 1 (Alternating 1s and 0s, Approach 1) 28:59 Example 2 (Approach 2 for Example 1, using epsilon to create options) 38:00 Example 3 (String contains at least one 1) 46:30 Example 4 (Even-length strings) 51:06 Example 5 (Detecting a substring) 57:23 Example 6 (Detecting if list of keywords appear) 1:02:14 Example 7 (Detecting a decimal number as string as per a format) Have a beautiful day! Supporters (to date of publication, by tier (top to bottom)): ---------------------------------------------------------- Patreon Supporters (General Support): Draikou Patreon Supporters (Basic Support): Patreon Supporters (Supporter Access!): Eric R ----------------------------------------------------------- Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content: PATREON:   / pagewizard   SUBSCRIBESTAR: https://www.subscribestar.com/drpage PAYPAL: https://paypal.me/pagewizard Follow also at: FACEBOOK:   / danielrpage   TWITTER:   / pagewizardgle   QUORA: https://www.quora.com/profile/Daniel-... TWITCH:   / pagewizard   #computerscience #theoryofcomputation #regex