Decidability and Undecidabilityof Marked PCP

Vesa Halava,Mika Hirvensalo,Ronald de Wolf

Decidability and Undecidabilityof Marked PCP（1999）

引用 10|浏览8

暂无评分

摘要

We show that the marked version of the Post Correspondence Problem, where the words on a list are required to differ in the first letter, is decidable. On the other hand, if we only require the words to differ in the first two letters, the problem remains undecidable. Thus we sharply locate the decidability/undecidability-boundary between marked and 2-marked PCP.

查看译文

关键词

2-marked PCP,Undecidabilityof Marked PCP,marked version,Post Correspondence Problem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要