- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Explain the Post Correspondence Problem in TOC

The **Post Correspondence Problem (PCP)** was introduced by Emil Post in 1946 and is an undecidable decision problem.

The PCP problem over an alphabet Σ is state. Given the following two lists, M and N of non-empty strings over Σ−

M = (x1, x2, x3,………, xn) N = (y1, y2, y3,………, yn)

We can say that there is a Post Correspondence Solution, if for some i1,i2,………… ik,

Where 1≤ ij ≤ n, the condition xi1 …….xik = yi1 …….yik satisfies.

## Example 1

Find whether the lists M = (abb, aa, aaa) and N = (bba, aaa, aa) have a Post Correspondence Solution.

## Solution

X1 | X2 | X3 | |

M | abb | aa | aaa |

N | bba | aaa | aa |

Here,

x2x1x3 = ‘aaabbaaa’

and y2y1y3 = ‘aaabbaaa’

We can see that

x2x1x3 = y2y1y3

Hence, the solution is i = 2, j = 1, and k = 3.

## Consider another example

Let us consider ,in PCP 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.

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 and 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

Domino’s Form.

Table form

- Related Articles
- What is the decision problem in TOC?
- What is the Halting Problem in TOC?
- Explain Chomsky hierarchy in TOC
- Explain Arden’s Theorem in TOC.
- Explain the concept of set in TOC?
- Explain the concept of strings in TOC?
- Explain the concept of derivation in TOC
- Explain the concept of grammar in TOC
- Explain the universal Turing machine in TOC
- Explain the power of an alphabet in TOC.
- Explain the various applications of automata in TOC
- Explain Type-0 grammar in TOC
- Explain Type-1 grammar in TOC
- Explain Deterministic Finite Automata in TOC.
- Explain Chomsky normal form in TOC