305 views
0 votes
0 votes
Show that the following modifications of the Post correspondence problem are undecidable.

$\text(a)$ There is an MPC solution if there is a sequence of integers such that $w_iw_j...w_kw_1 = v_iv_j...v_kv_i$.

$\text(b)$ There is an MPC solution if there is a sequence of integers such that $w_1w_2w_iw_j...w_k = v_1v_2v_iv_j...v_k$.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Rishi yadav asked Mar 16, 2019
389 views
Suppose we restrict the domain of the Post correspondence problem to include only alphabets with exactly two symbols. Is the resulting correspondence problem decidable$?$...
0 votes
0 votes
0 answers
3