Post Correspondence Problem
Post Correspondence Problem
The Post correspondence problem is an undividable conclusion problem that was inserted by Emil Post in 1946.Because Post correspondence problem is simpler than the halting problem and the Entscheidungs problem it is often used in proofs of undesirability. Post’s correspondence problem is very useful for showing the undesirability of many other problems by intends of reducibility. Its undesirability adopts from its capability for simulating the computations of Turing machines, as demonstrated circuitously in the adopting proof through derivations in Type 0 grammars.
An example for correspondence problem
A= {a, b, c}
g1 = abc g2 = abba g3 = c g4 = bbba g5 = abcc
h1 = ab h2 = aabb h3 = ccc h4 = cbbb h5 = aab
Looking for anything Else ? Try Our Search
