Explore BrainMass
Share

Show that the PCP is undecidable over a binary alphabet

Show that the PCP is undecidable over a binary alphabet, that is, over the alphabet  = {0,1}.

© BrainMass Inc. brainmass.com June 24, 2018, 4:43 pm ad1c9bdddf

Attachments

Solution Summary

The solution provides detailed explanations and answer for the problem.

$2.19