1 votes 1 votes atul_21 asked Jan 2, 2018 atul_21 1.8k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Ajay Jadhav commented Jan 2, 2018 reply Follow Share Give each step a number 1st step of A is 1,B's 1st step is 111 2nd step of A is 110,for B 2md step is 001 So same for 3rd step PCP (Post correspondence problem) you have to take sequences of steps no for A and B separately so that concatenate strings are same. In this look for option c (1,2,3) for A--> 1,110,0111 -->1110111 (1,2,3) for B--->111,001,11->1110111 strings match for this sequence step Do read more about PCP. 2 votes 2 votes Anu007 commented Jan 2, 2018 reply Follow Share Post correspondence problem, google it 0 votes 0 votes Ashwin Kulkarni commented Jan 2, 2018 reply Follow Share Post correspondence problem for the ambiguity of strings. 0 votes 0 votes atul_21 commented Jan 2, 2018 reply Follow Share Thank u so much Ajay Jadhav Anu007 Ashwin Kulkarni 1 votes 1 votes teluguenglish commented Nov 29, 2019 reply Follow Share which of the following intances of the post correspondance problem have a viable sequence? (A) { ( b,bb),(bb,bab),(bab,abb),(abb,babb)} (B) { (ab,aba),(baa,aa)(aba,baa) (C) {(ab,abb)(ba,aaa),(aa,a) (D) NONE HOW "C" IS THE ANSWER 0 votes 0 votes Please log in or register to add a comment.