0
5.2kviews
Explain post correspondence problem.
1 Answer
1
416views

The Post Correspondence Problem (PCP), introduced by Emil Post in 1946, is an undecidable decision problem. The PCP problem over an alphabet ∑ is stated as follows −

Given the following two lists, M and N of non-empty strings over ∑ −

M = (x1, x2, x3,………, xn)

N = …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.