Regular Languages to Regular Expressions
Neso Academy · 27:58
This lecture works through 12 exam-style problems that convert regular languages into regular expressions. The recurring method is to find the structure of the strings, use (a+b)* for "any combination", and use (aa)*...