MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
Can a Modified PCP problem be reduced to PCP?
1.
Can a Modified PCP problem be reduced to PCP?
A.
yes
B.
no
Answer» B. no
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Can a Modified PCP problem be reduced to PCP?
State true or false:Statement: The difference between PCP and MPCP is that in MPCP, a solution is required to start with the first string on each list.
Which of the following statements are undecidable?For a given Turing Machine M,
Which of the following is incorrect according to rice theorem?Let S be a set of language hat is non trivial:
Fill in the blank with reference to Rice s theorem.For any non-trivial property of __________ no general or effective method can decide whether an algorithm computes it with that property.
According to the rice s theorem, If P is a non trivial property, Lp is :
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
