Question: Let R 1 and R 2 be two regular expressions over the alphabet {a , b} a) Is it always the case that L(((R 1

Let R1 and R2 be two regular expressions over the alphabet {a , b}

a) Is it always the case that L(((R1).(R2))*) = L(((R1)|(R2))*)?

b) Is it always the case that L(((R1)*.(R2)*)*) = L(((R1)|(R2))*)?

c) Is it always the case that L((R1*)*) = L((R1)*)?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!