Question: DFA's and Regular Expressions. 1. Give a regular expression for the language L1: The alphabet is Sigma = {a,b} , L1 = {w | w
DFA's and Regular Expressions.
1. Give a regular expression for the language L1:
The alphabet is Sigma = {a,b} , L1 = {w | w contains the substring aab}
__________________________________________________________
2. Give a DFA for:
((bab U bb)* ba) U b*
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
