Question

Consider the language defined by the following regular expression. (x*y | zy*)* Does zyyxz belong to the language? Yes, because xz belongs to both x*y and zy*. Yes, because both xz and zyy belong to zy*. Yes, because zyy belongs to both x*y and zy*. No, because zyy does not belong to x*y nor zy*. No, because zyy belongs to zy*, but does not belong to x*y. No, because xz does not belong to x*y nor zy*. Does zyyzy belong to the language? Yes, because zy belongs to both x*y and zy*. Yes, because zyy belongs to both x*y and zy*. Yes, because both zy and zyy belong to zy*. No, because zy does not belong to x*y nor zy*. No, because zyy does not belong to x*y nor zy*. No, because zyy belongs to zy*, but does not belong to x*y

Answer 1

Consider the language defined by the following regular expression. (x*y | zy*)* 1. Does zyyxz belong to the language?

O. No, because zyy does not belong to x*y nor zy*

2. Does zyyzy belong to the language?

Yes, because both zy and zyy belong to zy*.

Step-by-step explanation: