Halava, Vesa; Harju, Tero; Karhumäki, Juhani; Latteux, Michel Extension of the decidability of the marked PCP to instances with unique blocks. (English) Zbl 1119.03041 Theor. Comput. Sci. 380, No. 3, 355-362 (2007). MSC: 03D40 03D03 03B25 PDF BibTeX XML Cite \textit{V. Halava} et al., Theor. Comput. Sci. 380, No. 3, 355--362 (2007; Zbl 1119.03041) Full Text: DOI OpenURL
Halava, Vesa; Harju, Tero Undecidability of infinite Post correspondence problem for instances of size 9. (English) Zbl 1114.03035 Theor. Inform. Appl. 40, No. 4, 551-557 (2006). Reviewer: Cristian S. Calude (Auckland) MSC: 03D35 03D40 68R15 PDF BibTeX XML Cite \textit{V. Halava} and \textit{T. Harju}, Theor. Inform. Appl. 40, No. 4, 551--557 (2006; Zbl 1114.03035) Full Text: DOI Numdam EuDML Link OpenURL
Halava, Vesa; Harju, Tero; Karhumäki, Juhani Decidability of the binary infinite Post Correspondence Problem. (English) Zbl 1023.03039 Discrete Appl. Math. 130, No. 3, 521-526 (2003). MSC: 03D40 03B25 68Q45 PDF BibTeX XML Cite \textit{V. Halava} et al., Discrete Appl. Math. 130, No. 3, 521--526 (2003; Zbl 1023.03039) Full Text: DOI OpenURL