Post Correspondence Problem

Home > Languages > Formal Language > Recursively Enumerable Languages > Post Correspondence Problem

The Post Correspondence problem is an example of an undecidable problem that asks whether two sets of strings can be concatenated to produce the same string.