This lecture covers the one of the most important concept of Automata that is known as Regular Expressions (RE). In this video regular expressions (RE) has been explained with help of examples .
RE is one of the language defining method.
In RE, language is represented in term of strings.
In a regular expression, x* means zero or more occurrence of x. It can generate {^, x, xx, xxx, xxxx, .....}
In a regular expression, x+ means one or more occurrence of x. It can generate {x, xx, xxx, xxxx, .....}

#AZComputing