Problème de correspondance de Post
undecidable decision problem: over some alphabet, given 2 finite sets A={a₁,…,aₙ} and B={b₁,…,bₙ} of words, is there a concatenation of words from A such that the same concatenation in the same order but using words from B produces the same result?