Post correspondence problem

Let A be an alphabet with at least two symbols. The input of the problem consists of two finite lists \alpha_{1}, \ldots, \alpha_{N} and \beta_{1}, \ldots, \beta_{N} of words over A. A solution to this problem is a sequence of indices (i_k)_{1 \le k \le K} with K \ge 1 and 1 \le i_k \le N for all k, such that : \alpha_{i_1} \ldots \alpha_{i_K} = \beta_{i_1} \ldots \beta_{i_K}. The decision problem then is to decide whether such a solution exists or not. Alternative definition :g: (i_1,\ldots,i_K) \mapsto \alpha_{i_1} \ldots \alpha_{i_K} :h: (i_1,\ldots,i_K) \mapsto \beta_{i_1} \ldots \beta_{i_K}. This gives rise to an equivalent alternative definition often found in the literature, according to which any two homomorphisms g,h with a common domain and a common codomain form an instance of the Post correspondence problem, which now asks whether there exists a nonempty word w in the domain such that :g(w)=h(w). Another definition describes this problem easily as a type of puzzle. We begin with a collection of dominos, each containing two strings, one on each side. An individual domino looks like :\begin{bmatrix}a \\ ab\end{bmatrix} and a collection of dominos looks like :{ \begin{bmatrix}bc \\ ca\end{bmatrix}, \begin{bmatrix}a \\ ab\end{bmatrix}, \begin{bmatrix}ca \\ a\end{bmatrix}, \begin{bmatrix}abc \\ c\end{bmatrix} }. The task is to make a list of these dominos (repetition permitted) so that the string we get by reading off the symbols on the top is the same as the string of symbols on the bottom. This list is called a match. The Post correspondence problem is to determine whether a collection of dominos has a match. For example, the following list is a match for this puzzle. :{ \begin{bmatrix}a \\ ab\end{bmatrix}, \begin{bmatrix}bc \\ ca\end{bmatrix}, \begin{bmatrix}a \\ ab\end{bmatrix}, \begin{bmatrix}abc \\ c\end{bmatrix} }. For some collections of dominos, finding a match may not be possible. For example, the collection :{ \begin{bmatrix}abc \\ ab\end{bmatrix}, \begin{bmatrix}ca \\ a\end{bmatrix}, \begin{bmatrix}acc \\ ba\end{bmatrix} }. cannot contain a match because every top string is longer than the corresponding bottom string. == Example instances of the problem ==

Example 1 Consider the following two lists: A solution to this problem would be the sequence (3, 2, 3, 1), because : \alpha_3 \alpha_2 \alpha_3 \alpha_1 = bba \cdot ab \cdot bba \cdot a = bbaabbbaa = bb \cdot aa \cdot bb \cdot baa = \beta_{3} \beta_{2} \beta_{3} \beta_{1}. Furthermore, since (3, 2, 3, 1) is a solution, so are all of its "repetitions", such as (3, 2, 3, 1, 3, 2, 3, 1), etc.; that is, when a solution exists, there are infinitely many solutions of this repetitive kind. However, if the two lists had consisted of only \alpha_2, \alpha_3 and \beta_{2}, \beta_{3} from those sets, then there would have been no solution (the last letter of any such α string is not the same as the letter before it, whereas β only constructs pairs of the same letter). A convenient way to view an instance of a Post correspondence problem is as a collection of blocks of the form there being an unlimited supply of each type of block. Thus the above example is viewed as i = 1 i = 2 i = 3 where the solver has an endless supply of each of these three block types. A solution corresponds to some way of laying blocks next to each other so that the string in the top cells corresponds to the string in the bottom cells. Then the solution to the above example corresponds to: i1 = 3 i2 = 2 i3 = 3 i4 = 1 Example 2 Again using blocks to represent an instance of the problem, the following is an example that has infinitely many solutions in addition to the kind obtained by merely "repeating" a solution. 1 2 3 In this instance, every sequence of the form (1, 2, 2, . . ., 2, 3) is a solution (in addition to all their repetitions): 1 2 2 2 3 ==Proof sketch of undecidability ==

The most common proof for the undecidability of PCP describes an instance of PCP that can simulate the computation of an arbitrary Turing machine on a particular input. A match will occur if and only if the input would be accepted by the Turing machine. Because deciding if a Turing machine will accept an input is a basic undecidable problem, PCP cannot be decidable either. The following discussion is based on Michael Sipser's textbook Introduction to the Theory of Computation. In more detail, the idea is that the string along the top and bottom will be a computation history of the Turing machine's computation. This means it will list a string describing the initial state, followed by a string describing the next state, and so on until it ends with a string describing an accepting state. The state strings are separated by some separator symbol (usually written #). According to the definition of a Turing machine, the full state of the machine consists of three parts: • The current contents of the tape. • The current state of the finite-state machine which operates the tape head. • The current position of the tape head on the tape. Although the tape has infinitely many cells, only some finite prefix of these will be non-blank. We write these down as part of our state. To describe the state of the finite control, we create new symbols, labelled q1 through qk, for each of the finite-state machine's k states. We insert the correct symbol into the string describing the tape's contents at the position of the tape head, thereby indicating both the tape head's position and the current state of the finite control. For the alphabet {0,1}, a typical state might look something like: 101101110q700110. A simple computation history would then look something like this: q0101#1q401#11q21#1q810. We start out with this block, where x is the input string and q0 is the start state: The top starts out "lagging" the bottom by one state, and keeps this lag until the very end stage. Next, for each symbol a in the tape alphabet, as well as #, we have a "copy" block, which copies it unmodified from one state to the next: We also have a block for each position transition the machine can make, showing how the tape head moves, how the finite state changes, and what happens to the surrounding symbols. For example, here the tape head is over a 0 in state 4, and then writes a 1 and moves right, changing to state 7: Finally, when the top reaches an accepting state, the bottom needs a chance to finally catch up to complete the match. To allow this, we extend the computation so that once an accepting state is reached, each subsequent machine step will cause a symbol near the tape head to vanish, one at a time, until none remain. If qf is an accepting state, we can represent this with the following transition blocks, where a is a tape alphabet symbol: We need one final adaptation for the proof to work: as written above, the block with symbol a can simply be used in isolation to satisfy the solution. One way to adapt it is to use two different versions of each tape symbol, and require that they alternate from one state to the next. With this change, the initial tile is the only tile that can go first in the match. We can also enforce the final end state of the computation, for example with another symbol (here denoted #end) to terminate the entire history: This shows how a static tile puzzle can simulate a Turing machine computation. The previous example q0101#1q401#11q21#1q810. is represented as the following solution to the Post correspondence problem: ... == Variants ==

Many variants of PCP have been considered. One reason is that, when one tries to prove undecidability of some new problem by reducing from PCP, it often happens that the first reduction one finds is not from PCP itself but from an apparently weaker version. • The problem may be phrased in terms of monoid morphisms f, g from the free monoid B∗ to the free monoid A∗ where B is of size n. The problem is to determine whether there is a word w in B+ such that f(w) = g(w). • The condition that the alphabet A have at least two symbols is required since the problem is decidable if A has only one symbol. • A simple variant is to fix n, the number of tiles. This problem is decidable if n ≤ 2, but remains undecidable for n ≥ 5. It is unknown whether the problem is decidable for 3 ≤ n ≤ 4. • The '''circular Post correspondence problem''' asks whether indexes i_1, i_2,\ldots can be found such that \alpha_{i_1} \cdots \alpha_{i_k} and \beta_{i_1} \cdots \beta_{i_k} are conjugate words, i.e., they are equal modulo rotation. This variant is undecidable. • One of the most important variants of PCP is the '''bounded Post correspondence problem', which asks if we can find a match using no more than k tiles, including repeated tiles. A brute force search solves the problem in time O(2k''), but this may be difficult to improve upon, since the problem is NP-complete. Unlike some NP-complete problems like the boolean satisfiability problem, a small variation of the bounded problem was also shown to be complete for RNP, which means that it remains hard even if the inputs are chosen at random (it is hard on average over uniformly distributed inputs). • Another variant of PCP is called the '''marked Post Correspondence Problem''', in which each \alpha_i must begin with a different symbol, and each \beta_i must also begin with a different symbol. Halava, Hirvensalo, and de Wolf showed that this variation is decidable in exponential time. Moreover, they showed that if this requirement is slightly loosened so that only one of the first two characters need to differ (the so-called 2-marked Post Correspondence Problem), the problem becomes undecidable again. • The Post Embedding Problem is another variant where one looks for indexes i_1, i_2, \ldots such that \alpha_{i_1} \cdots \alpha_{i_k} is a (scattered) subword of \beta_{i_1} \cdots \beta_{i_k}. This variant is easily decidable since, when some solutions exist, in particular a length-one solution exists. More interesting is the '''Regular Post Embedding Problem''', a further variant where one looks for solutions that belong to a given regular language (submitted, e.g., under the form of a regular expression on the set \{1,\ldots,N\}). The Regular Post Embedding Problem is still decidable but, because of the added regular constraint, it has a very high complexity that dominates every multiply recursive function. • The Identity Correspondence Problem (ICP) asks whether a finite set of pairs of words (over a group alphabet) can generate an identity pair by a sequence of concatenations. The problem is undecidable and equivalent to the following Group Problem: is the semigroup generated by a finite set of pairs of words (over a group alphabet) a group.{{cite journal|author = Paul C. Bell |author2=Igor Potapov |title =On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups |year = 2010|journal = International Journal of Foundations of Computer Science |volume =21 |issue=6 |pages=963–978 • The problem has been studied in the context of groups, using a similar phrasing to the monoid morphism language. '''Post's Correspondence Problem for Groups''' takes as input a pair of group homomorphisms f, g: F(B)\to G from the free group F(B) to the group G, and tries to determine whether there is a word w in F(B) such that f(w) = g(w)\neq1. It is known to be decidable when G is a virtually nilpotent group, and undecidable for G a hyperbolic group.{{cite journal|author = Laura Ciobanu |author2=Alex Levine |author3=Alan D. Logan |title =Post's Correspondence Problem for hyperbolic and virtually nilpotent groups |year = 2024|journal = Bulletin of the London Mathematical Society |volume =56 |issue=1 |pages=159–175 == References ==