==
The Question
==
Mw on input x: run M on w for |x| steps
if stops reject
else rum Matm(epsilon) on M and accepts if Matm(epsilon) accept.
==
What I understand:
==
lets say M halts on w after k steps.
so if |x| > k M halts on w and than I reject so I got finite number of words in the language and than its regular?
and all the words in the langueage have to be in length |x|< k.
But I cant say its regular because than Im going to the second condition and I know that Matm(epsilon) is not in R, so its not reuglar

I don't understand your last sentence. What is the meaning of "Matm(epsilon) is not in R"? Matm(epsilon) is
an execution. It can halt or not, but it is meaningless to say that it is not in R (or is in R).
Anyhow, it does not matter how M_eps acts on x-s with |x|<k or if it halts or not, as this set of x-s is finite anyhow.