(classic problem)
Definition: Given a set of pairs of strings, find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem.
Also known as PCP.
Author: SKS
Ling Zhao's page with examples, notes on programs to find solutions, etc..
Emil Post, A Variant of a Recursively Unsolvable Problem. Bulletin of the American Mathematical Society, 52:264-268, 1946.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 23 January 2006.
HTML page formatted Mon Sep 11 09:46:06 2006.
Cite this as:
Sandeep Kumar Shukla, "Post's correspondence problem", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 23 January 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/postsCorrespondProb.html
