the language is accepted by DPDA.so it is decidable
if Aα(reducible)B if B is decidable then A is also decidable
so M is decidable(turing machine)
but turing machine acceptance problem is undecidable.
we cannot guarntee that turing maching halts for all inputs,it depends on the input given
so turing machine acceptance is undecidable