首页 > Term: Post's correspondence problem (PCP)
Post's correspondence problem (PCP)
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.
0
创建者
- GeorgeV
-
(Gold) 1123 分数 - 100% positive feedback
