A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM
Tekijät: Halava V, Holub S
Kustantaja: WORLD SCIENTIFIC PUBL CO PTE LTD
Julkaisuvuosi: 2011
Journal: International Journal of Foundations of Computer Science
Tietokannassa oleva lehden nimi: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Lehden akronyymi: INT J FOUND COMPUT S
Numero sarjassa: 2
Vuosikerta: 22
Numero: 2
Aloitussivu: 473
Lopetussivu: 490
Sivujen määrä: 18
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054111008143
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali