0 votes 0 votes 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. Theory of Computation michael-sipser theory-of-computation post-correspondence-problem decidability proof + – admin asked Oct 19, 2019 edited Oct 19, 2019 by Lakshman Bhaiya admin 303 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.