Solved

Which One of the Following Is Not Decidable

Question 16

Multiple Choice

Which one of the following is not decidable?


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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q11: Consider a graph G = (V, E)

Q12: Let FHAM be the problem of finding

Q13: If r1 = (aa + bb) and

Q14: Out of the three decision problems P1,

Q15: Two persons X and Y have been

Q17: Choose the incorrect statement.<br>A)A Mealy machine generates

Q18: The problem 3-SAT and 2-SAT are<br>A)Both in

Q19: Context free grammar is used for-<br>A)Lexical analyzer<br>B)Document

Q20: 3-SAT and 2-SAT problems are<br>A)NP-complete and in

Q21: Choose the incorrect statement:<br>A)(a+b)aa(a+b)generates Regular language.<br>B)A language