in Theory of Computation edited by
305 views
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.

in Theory of Computation edited by
by
305 views

Please log in or register to answer this question.

Related questions