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
Get step-by-step solutions from verified subject matter experts
