Question: Which of this regular expression doesn't show a language with finite set of strings? 1) xyz 2) (xy)+z 3)(x+y)+(x+y) 4) x+(y+z) 5)x+yz*

Which of this regular expression doesn't show a language with finite set of strings?

1) xyz

2) (xy)+z

3)(x+y)+(x+y)

4) x+(y+z)

5)x+yz*

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!