Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time

Vesa Halava, Stepan Holub. Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci., 35(1&2):129-144, January & February 2024. [doi]

Abstract

Abstract is missing.