We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM.
- Authors
HALAVA, VESA; HOLUB, ŠTĚPÁN; Salomaa, Arto
- Abstract
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper we study the reduction tree of GPCP in the binary case. This entails in particular a detailed analysis of the structure of end blocks. We give an upper bound for the number of end blocks, and show that even if an instance has more than one successor, it can nevertheless be reduced to a single instance. This, in particular, implies that binary GPCP can be decided in polynomial time.
- Subjects
DATA reduction; TREE graphs; CORRESPONDENCE principle (Quantum mechanics); DECISION making; BINARY number system; POLYNOMIALS; SET theory
- Publication
International Journal of Foundations of Computer Science, 2011, Vol 22, Issue 2, p473
- ISSN
0129-0541
- Publication type
Article
- DOI
10.1142/S0129054111008143