@manu00x Any source of the claim that the problem of accepting arbitrary TM printing that ever writes something on input tape is "Decidable Problem"?
Why a proof similar to the problem of accepting TM ever printing a specific letter, is invalid?
Let us replace the transitions that halt the TM with the transitions that halt the TM and write something on input tape, Now, the halting problem of original TM is reduced to this problem. And since, the halting problem is undecidable this problem should be undecidable.
Where I'm going wrong?
For creating automatas you can also ...