Back to Questions
Computer Science Fundamentals Algorithms Objective
Nov 23, 2012

Which one of the following is not decidable?

Choose the correct answer:
A) given a Turing machine M, a string s, and an integer k, M accepts s with k steps
B) equivalence of two given Turing machines
C) language accepted by a given DFSA is nonempty
D) language generated by a CFG is nonempty
Detailed Explanation
No Explanation
Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback