Editing Post correspondence problem (section)

== External links ==

* Eitan M. Gurari. ''An Introduction to the Theory of Computation'', Chapter 4, [https://web.archive.org/web/20050214072238/http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk-fourse7.html Post's Correspondence Problem]. A proof of the undecidability of PCP based on [[Chomsky hierarchy#The hierarchy|Chomsky type-0 grammar]]s.
* Dong, Jing. [http://www.atlantis-press.com/php/download_paper.php?id=3059 "The Analysis and Solution of a PCP Instance."] 2012 National Conference on Information Technology and Computer Science. The paper describes a heuristic rule for solving some specific PCP instances.  
* [http://jamesvanboxtel.com/projects/pcp-solver/ Online PHP Based PCP Solver]
* [https://web.archive.org/web/20090309162234/http://www.theory.informatik.uni-kassel.de/~stamer/pcp/pcpcontest_en.html PCP AT HOME]
* [http://webdocs.cs.ualberta.ca/~games/PCP/ PCP - a nice problem]
* [https://github.com/dcatteeu/PCPSolver PCP solver in Java]
* [https://www.interviewbit.com/blog/post-correspondence-problem/ Post Correspondence Problem]


{{DEFAULTSORT:Post Correspondence Problem}}
[[Category:Theory of computation]]
[[Category:Computability theory]]
[[Category:Undecidable problems]]