Is the set of pairs of TMs at least one of which accepts the empty word semi-deciable?

L = { < M1,M2 > | M1,M2 are TM's and Ɛ ∈ L(M1) ∪ L(M2) }

Where Ɛ = Epsilon

I know that this language is undecidable, but why it is semidecidable too.

What i have tried is =>

Using Rice's Theorem, part 2

T(no) = (0,1)^+ and T(yes) = (0,1)*

Which gives that T(yes) is not a subset of T(no), and this says that it is semidecidable.

Is my understanding right ?

• Welcome to Computer Science! Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. – Raphael Sep 21 '16 at 14:31

Idea: Simulate both $M_1$ and $M_2$ on $\varepsilon$ simultaneaously using dovetailing. If either one halts and accepts, stop simulating and accept.