Computer Science · Theory of Computation
Consider two Post Correspondence Problem (PCP) instances, X and Y, with lists of strings over the alphabet {0, 1}: Instance X: List A = [1, 10111, 10], List B = [111, 10, 0] Instance Y: List A = [10, 011, 101], List B = [101, 11, 011] Which of the following statements is true regarding these instances?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1PCP neither in X nor in Y has a solution.
- 2PCP in both X and Y has a solution.
- 3Only PCP in Y has a solution.
- 4Only PCP in X has a solution.✓
Correct answer
Only PCP in X has a solution.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation