edited by
1,028 views
0 votes
0 votes

Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$
$X$ : 

List A List B
$1$ $111$
$10111$ $10$
$10$ $0$

$Y$:

List A List B
$10$ $101$
$011$ $11$
$101$ $011$


Which of the following is true?

  1. Only PCP in $\text{X}$ has solution.,
  2. Only PCP in $\text{Y}$ has solution.,
  3. PCP in both $\mathrm{X}$ and $\mathrm{Y}$ has solution.
  4. PCP neither in $\mathrm{X}$ nor in $\mathrm{Y}$ has solution.,
edited by

1 Answer

2 votes
2 votes

The goal of PCP is to arrange the input in such a way that the string created by the denominator and the numerator is same. 

X
List A List B
              1    111
      10111      10
            10        0

$\ start\ with\ 2^{nd} \ row$   

 $\frac{10111}{10}\ there \ is\ remaining\ 111\ in\ numerator\ to\ satisfy\ this\ take\ 1^{st}\ row$

$\frac{10111}{10}\frac{1}{111}$

$\ now \ take\ again\ 1^{st}\ row$

$\frac{10111}{10}\frac{1}{111}\frac{1}{111}\\ $

$\ now \ will\ take\ 3^{rd}\ row$

$\frac{10111}{10}\frac{1}{111}\frac{1}{111}\frac{10}{0}$

$\  X\ has\ a\ solution$

Y
     List A      List B
        10   101
       011     11
       101      011

$\ start\ from\ where\ starting\ string\ matches$

$\ so\ start\ with\ 1^{st}\ row$

$\frac{10}{101}\ here\ remaining\ string\ in\ denominator\ is\ 1$

$\ take\ 3^{rd}\ row$

$\frac{10}{101} \frac{101}{011}$

$\ again\ remaining\ string\ in\ denominator\ is\ 1\ and\ it\ will\ be\ infinte$

$\ Y\ has\ no\ solution.$

$\ Answer:\ Only\ PCP\ in\  X\ has\ solution\ and\ PCP\ in\ Y\ has\ no\ solution.$

Related questions

1 votes
1 votes
0 answers
1
admin asked Oct 23, 2022
970 views
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are$7, 4$$7, 1$$7, 46$$55,1$
0 votes
0 votes
1 answer
3
admin asked Oct 23, 2022
324 views
Size and complexity are a part ofPeople MetricsProject MetricsProcess MetricsProduct Metrics
1 votes
1 votes
0 answers
4
admin asked Oct 23, 2022
336 views
The solution of the recurrence relation $T(n)=3 T(n / 4)+n \lg n$ is$\theta\left(n^{2} \lg n\right)$$\theta(n \lg n)$$\theta(n \lg n)^{2}$$\theta(n \lg \lg n)$