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]

Authors

Vesa Halava

This author has not been identified. Look up 'Vesa Halava' in Google

Stepan Holub

This author has not been identified. Look up 'Stepan Holub' in Google