Question: Show that for | sum | = 1 , the Post correspondence problem is decidable, that is , there is an algorithm that can decide
Show that for sum the Post correspondence problem is decidable, that is there is an
algorithm that can decide whether or not A;B has a PC solution for any given A;B on a
singleletter alphabet.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
