Q6.5

Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ steps

Equivalence of two given Turing machines

Language accepted by a given finite state machine is not empty

Language generated by a context free grammar is non-empty