M

Mr. Dubey • 52.30K Points
Coach 

Q. 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 : Option (B)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. {3}Є{1,3,5}

Q. Behavioral testing is

Q. _______ are needed to identify training data and desired results.

Q. A data dictionary is created when a __________ created.

Q. Slide Rules was invented in

Q. The time required for a pulse to change from 10 to 90 percent of its maximum value is called

Q. __________ is a CPU emulator and virtual machine monitor.

Q. An senior management of the bank is keen to incorporate as an integral part of its business strategy.

Q. ____ is the amount of data that can be transmitted in a fixed amount of time

Q. What are the characteristics of process migr