Q. Which one of the following is not decidable? (Solved)
1. given a Turing machine M, a string s, and an integer k, M accepts s with k steps
2. equivalence of two given Turing machines
3. language accepted by a given DFSA is nonempty
4. language generated by a CFG is nonempty
- b. equivalence of two given Turing machines