Question: 3. Consider the following two regular expressions over A (0, 1): (a) 1(0*01)*1 and (b) (100*) *11*. Check if these expressions are equivalent (i.e., if

3. Consider the following two regular expressions over A (0, 1): (a) 1(0*01)*1 and (b) (100*) *11*. Check if these expressions are equivalent (i.e., if they define the same languages) by comparing the corresponding deterministic automata. Try to find the finite automata directly from the regular expressions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
