1. A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg. The (Generalized) Post Correspondence Problem with Lists Consisting of Two Words Is Decidable. Theoret. Comput. Sci., 21:119–144, 1982.
2. V. Halava. Post Correspondence Problem and Its Modifications for Marked Morphisms. PhD thesis, University of Turku, (Manuscript).
3. V. Halava, T. Harju, and M. Hirvensalo. Binary (Generalized) Post Correspondence Problem. Technical Report 357, Turku Centre for Computer Science, August 2000. to appear in Theoret. Comput. Sci.
4. V. Halava, M. Hirvensalo, and R. de Wolf. Marked PCP Is Decidable. Theoret. Comput. Sci., 255(1–2):193–204, 2001.
5. Y. Matiyasevich and G. Sénizergues. Decision Problems for Semi-Thue Systems with a Few Rules. In Proceedings, 11
th
Annual IEEE Symposium on Logic in Computer Science, pages 523–531, New Brunswick, New Jersey, 27–30 July 1996. IEEE Computer Society Press.