Reduction tree of the binary generalized post correspondence problem

Abstrakt

The paper describes the structure of the tree of successors for the binary case of the Generalized Post Correspondence Problem. It shows that for practical purposes the tree can be considered linear.

Klíčová slova

• REDUCTION
• TREE
• BINARY
• GENERALIZED
• POST
• CORRESPONDENCE
• PROBLEM