We are currently writing a book on Post Correpondence Problem. The working title is
Vesa Halava, Tero Harju and Juhani Karhumäki
Updated November 2006
Undecidability through Post Correspondence Problem
The book consists of undecidability results, basics undecidability proofs for Post Correspondence Problem and it's most significant modifications, undecidability proofs for Thue and semi-Thue systems, basics on Turing machines and undecidability of the halting problem. Also, applications of the undecidability of the Post Correspondence Problem are studied, namely in theory of integer matrices and language theory.
From these pages you will find draft versions of the book chapters.