The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability.
(cited from wiki)
Please note it is not total solution until now.
go get github.com/kkdai/pcp
package main
import (
"github.com/kkdai/pcp"
)
func main() {
p := PCP{}
p.AddDomino("ab", "b")
p.AddDomino("b", "a")
p.AddDomino("a", "ab")
ret, _ := p.FindSolution()
fmt.Println("Ret=", ret)
}
- Coursera: Automata
- Wiki
- Theory of computation / Post’s Correspondence Problems (PCP)
- Github:PCPSolver
- PCP News
- Paper: Tackling Post’s Correspondence Problem
- Thesis: Solving and Creating Difficult Instances of Post’s Correspondence Problem
It is one of my project 52.
This package is licensed under MIT license. See LICENSE for details.