The following publications are possibly variants of this publication:
- A New Proof for Undecidability of the Bi-Infinite Post Correspondence ProblemVesa Halava, Tero Harju, Esa Sahla. FUIN, 154(1-4):167-176, 2017. [doi]
- The exact complexity of the infinite Post Correspondence ProblemOlivier Finkel. ipl, 115(6-8):609-611, 2015. [doi]
- Decidability of the binary infinite Post Correspondence ProblemVesa Halava, Tero Harju, Juhani Karhumäki. DAM, 130(3):521-526, 2003. [doi]
- Infinite Solutions of Marked Post Correspondence ProblemVesa Halava, Tero Harju. BIRTHDAY 2002: 57-68 [doi]
- Undecidability of infinite post correspondence problem for instances of Size 9Vesa Halava, Tero Harju. ita, 40(4):551-557, 2006. [doi]
- The Structure of Infinite Solutions of Marked and Binary Post Correspondence ProblemsVesa Halava, Tero Harju, Juhani Karhumäki. mst, 40(1):43-54, 2007. [doi]
- Flatwords and Post Correspondence ProblemTero Harju, Marjo Lipponen, Alexandru Mateescu. TCS, 161(1&2):93-108, 1996. [doi]
- On the n-permutation Post Correspondence ProblemMari Ernvall, Vesa Halava, Tero Harju. TCS, 601:15-20, 2015. [doi]
- Post Correspondence Problem for short wordsVesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki. ipl, 108(3):115-118, 2008. [doi]