Tackling Post's Correspondence Problem
نویسنده
چکیده
Post’s correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solution, and to find the solutions if they exist. In this paper, we describe new application-dependent methods used to efficiently find optimal solutions to individual instances, and to identify instances with no solution. We also provide strategies to create hard PCP instances with long optimal solutions. These methods are practical approaches to this theoretical problem, and the experimental results present new insights into PCP and show the remarkable improvement achieved by the incorporation of knowledge into general search algorithms in the domain of PCP. 1
منابع مشابه
Total Termination of Term Rewriting is Undecidable
Usually termination of term rewriting systems (TRS's) is proved by means of a mono-tonic well-founded order. If this order is total on ground terms, the TRS is called totally terminating. In this paper we prove that total termination is an undecidable property of nite term rewriting systems. The proof is given by means of Post's Correspondence Problem.
متن کاملSolving and Creating Difficult Instances of Post's Correspondence Problem and Creating Difficult Instances of Post's Correspondence Problem
Post’s correspondence problem (PCP) was invented by Emil L. Post in 1946. It is an undecidable problem, which means that it is impossible to find an algorithm to solve the whole problem. This problem has been extensively discussed in the theoretical computer science literature, but only recently did some researchers begin to look into the empirical properties of this problem. Although this prob...
متن کاملA New Method for Undecidability Proofs of First Order Theories
We claim that the reduction of Post's Correspondence Problem to the decision problem of a theory provides a useful tool for proving undecidability of rst order theories given by some interpretation. The goal of this paper is to deene a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associ...
متن کاملUndecidability of Plane Polygonal Mereotopology
This paper presents a mereotopological model of polygonal regions of the Euclidean plane and an undecidability proof of its rst-order theory. Restricted to the primitive operations the model is a Boolean algebra. Its single primitive predicate deenes simple polygons as the topologically simplest poly-gonal regions. It turns out that both the relations usually provided by mereotopolo-gies and mo...
متن کاملUndecidable Veriication Problems for Programs with Unreliable Channels
We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model e.g. link protocols such as the Alternating Bit Protocol and HDLC. In an earlier paper, we showed that the problems of checking reachability, safety properties, and eventuality properties are...
متن کامل