0 votes 0 votes Show that the Post Correspondence Problem is decidable over the unary alphabet $\Sigma = \{1\}$. Theory of Computation michael-sipser theory-of-computation post-correspondence-problem decidability proof + – admin asked Oct 19, 2019 retagged Oct 19, 2019 by Lakshman Bhaiya admin 251 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.