Is L = $\{\langle M,w\rangle \mid \text{$M$ accepts string epsilon or string $w$, or both} \}$ decidable?
I attempted to use Rice's Theorem for this question to prove that it is undecidable.
Is my approach in the right direction if I let S, the non-trivial subset of recognizable languages, in this case to be S = {L | $\epsilon$ $\in$ L or $w$ $\in$ L and when both $\in$ L}?
