In the silly Post Correspondence Problem, $SPCP$, the top string in each pair has the same length as the bottom string. Show that the $SPCP$ is decidable.
64.3k questions
77.9k answers
244k comments
80.0k users