Q2 CS701 – Theory of Computation Assignment 2 Due Date: 15-06-2015

                      https://www.facebook.com/mscsinterface

Question 2                       (12 Marks)
A variant of Post Correspondence Problem (PCP)  is in which  in each pair the top string has the same length as the bottom string. Show that this variant of PCP is decidable. 

You Can Choice only one Solution Both are Right

Solution 1:

Decidable. Let's do an example first. Suppose you are given the following PCP1 instance:












 Second Solution: