Which of the following are decidable problems?a) Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}

Question

Which of the following are decidable problems?a) Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec)  Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}

TuteeHUB · Accepted Answer

NA

TuteeHUB · Answer

Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec)  Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problem

TuteeHUB · Answer

Do two given CFG’s generate the same languagec)  Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidable

TuteeHUB · Answer

Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizable

TuteeHUB · Answer

None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizabled) All of the mentionedView Answer

1.	Which of the following are decidable problems?a) Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)\|M is a turing machine that accepts string w}
A.	Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)\|M is a turing machine that accepts string w}a) A concrete undecidable problem
B.	Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)\|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidable
C.	Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)\|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizable
D.	None of the mentioned 7.Which one of the following is true for the given?A={(M,w)\|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizabled) All of the mentionedView Answer
Answer» E.

Discussion

No Comment Found

Related MCQs

Reply to Comment