Scribd
Upload
17 views22 pages

sakthi PCP

The Post Correspondence Problem (PCP) is an undecidable problem that involves arranging dominos to create matching strings from two lists. The document explains the problem's mechanics, provides examples, and discusses its undecidability by relating it to the acceptance problem of Turing machines. It concludes with a construction method for transforming Turing machine configurations into instances of PCP.

Uploaded by

venkat Mohan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
17 views22 pages

sakthi PCP

The Post Correspondence Problem (PCP) is an undecidable problem that involves arranging dominos to create matching strings from two lists. The document explains the problem's mechanics, provides examples, and discusses its undecidability by relating it to the acceptance problem of Turing machines. It concludes with a construction method for transforming Turing machine configurations into instances of PCP.

Uploaded by

venkat Mohan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

1

Post Correspondence Problem is a popular undecidable problem that


was introduced by Emil Leon Post in 1946.

It is simpler than Halting Problem.

In this problem we have N number of Dominos (tiles).

The aim is to arrange tiles in such order that string made by


Numerators is same as string made by Denominators.

In simple words, lets assume we have two lists both containing N


words, aim is to find out concatenation of these words in some
sequence such that both lists yield same result.

2
Let’s try understanding this by taking two lists A and B

A=[aa, bb, abb] and B=[aab, ba, b]

Now for sequence 1, 2, 1, 3


First list will yield aabbaaabb
Second list will yield same string aabbaaabb.

So the solution to this PCP becomes 1, 2, 1, 3.

Post Correspondence Problems can be represented in two ways:


1. Domino’s Form
2. Table Form

3
Exercise 1

Final Solution - 2 1 1 3 String made by numerators: 101111110


String made by denominators: 101111110

4
5
Exercise 3

String made by numerator is 100 1 100 100,


String made by denominator is 1 00 1 1 1.
The 6th digit in numerator string is 0 which is different from 6th
digit in string made by denominator which is 1.

We can try unlimited combinations like one above but none of


combination will lead us to solution, thus this problem does not
have solution.
6
7
Exercise 5

Set of Domios
ab ba b abb a
aba abb ab b bab

X Y

ab aba
ba abb
b ab
abb b
a bab

8
ab ba b abb a
aba abb ab b bab

ab a ba b abb abb b abb


aba bab abb ab b b ab b

X =ababababbabbbabb
Y =ababababbabbbabb

X= Y

9
Post Correspondence Problem is Undecidable
Acceptance Problem of TM is Modified PCP
Its Solution always starts with index 1

10
11
Undecidability of Post Correspondence Problem :
As theorem says that PCP is undecidable. That is, there is no
particular algorithm that determines whether any Post
Correspondence System has solution or not.

Proof –
We already know about undecidablitiy of Turing Machine. If we are
able to reduce Turing Machine to PCP then we will prove that PCP
is undecidable as well.
Consider Turing machine M to simulate PCP’s input string w can be
represented as .

12
If there is match in input string w, then Turing machine M halts in
accepting state.
This halting state of Turing machine is acceptance problem A TM.

We know that acceptance problem ATM is undecidable. Therefore


PCP problem is also undecidable.

To force simulation of M, we make 2 modifications to Turing


Machine M and one change to our PCP problem.

M on input w can never attempt to move tape head beyond left


end of input tape. If input is empty string € we use .

PCP problem starts match with first domino [u1/v1] This is called
Modified PCP problem.

MPCP = {[D] | D is instance of PCP starts with first domino} 13


Construction Steps –
1.Put [# / (#q0w1w2..wn#)] into D as first domino, where is instance
of D is MPCP. A partial match is obtained in first domino is # at one
face is same #symbol in other face.
2.Transition functions for Turing Machine M can have moves Left L,
Right R. For every x, y z in tape alphabets and q, r in Q where q is not
equal to qreject. If transition(q, x) = (r, y, R) put domino [qx / yr] into D
and transition(q, x) =(r, y, L) put domino [zqx / rzy] into D.
3.For every tape alphabet x put [x / x] into D.To mark separation of
each configurations put [# / #] and [# / _#] into D .
4.To read input alphabets x even after Turing Machine is accepting
state put [xqa / qa] and [qax / qa]and [qa# / #] into D. These steps
concludes construction of D.
Since this instance of MPCP, we need to convert this to PCP. So to
convert to D, we consider below domino and strings matching.
14
Example

TM = (Q,Σ,δ, Γ,q0,B,F)

Σ = {a,b}, Γ = {a,b,B,X}

Input w = aba

15
Step 1

a b a

q0
ID q0aba

# #
#q0w# #q0aba#

16
Step 2

δ (q0, a) = (q1, X, R)

a X
=
q0 q1

q0a = Xq1

q0a
Xq1

17
Step 3

δ (q1, b) = (q2, X, L)

Y b = Y X

q1 q2
Yq1b = q2YX

YЄΓ Γ = {a,b,B,X}

aq1b bq1b Bq1b Xq1b


q2aX q2bX q2BX q2XX

18
Step 4
For all possible tape symbol
Γ = {a,b,B,X}

a b X B
a b X B
Step 5
For all possible tape symbol Γ = {a,b,B,X}
q2  only accepting state

aq2 q2a bq2 q2b Bq2 q2B Xq2 q2X


q2 q2 q2 q2 q2 q2 q2 q2

19
Step 6

# #
# B#

Step 7

q2# #
#

20
Solution

# q0a b a #
#q0aba# Xq1 b a #

# Xq1b a #
#Xq1ba# q2XX a #

# q2X X a #
#q2XXa# q2 X a #

21
# q2X a #
#q2Xa# q2 a #

# q2a #
#q2a# q2 #

# q2# #
#q2# #

PCP is Undecidable

22

You might also like