Decidability

Question

L={R | R is a regular expression, with atleast one w belongs to L(R), i.e. 101 is substring of w}

Which one true?

a)L is decidable

b) L is undecidable

c)L is partially decidable

Comments

Membership and Emptiness both are Deciadable for regular languages then, it should be deciadable.

---

Looks like an unorganized question.

---

What does this Question wants to say ?

And Language is defined on some Alphabet. Hence, A Language contains only Strings made of this alphabet. Language can not contain Regular Expressions.

---

101 cannot be a substring with some alphabet?

Answer 1

option is A

because Regular languages accepts membership algorithm as the is talking about membership algorithm