Multiple Choice
If an effectively solvable problem has answered in yes or no, then this solution is called
A) Decision procedure
B) Decision method
C) Decision problem
D) Decision making
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q14: Recursively enumerable languages are not closed under<br>A)Complementation<br>B)Union<br>C)Intersection<br>D)None
Q15: Which of the following assertions about Turing
Q16: The regular expression have all strings in
Q17: For s ? (0+1)* let d(s) denote
Q18: Suppose that a problem A is known
Q20: Languages are proved to be regular or
Q21: The languages -------------- are the examples of
Q22: _ states are called the halt states.<br>A)ACCEPT
Q23: Let L<sub>1</sub> be a recursive language, and
Q24: Consider the regular language L =(111+11111)*. The