Designing Regular Expressions
Neso Academy · 11:10
This Neso Academy Theory of Computation lecture shows how to turn a regular language (regular set) into a regular expression: a one-string set is that string, commas become union (+), and infinite patterned sets becom...