Abstract
We show that the binary generalized Post’s Correspondence Problem is decidable in polynomial time for the case where both morphisms are periodic. Our result is based on combinatorial properties and we have formalized the proofs and verified correctness of our algorithm using the Isabelle/HOL formal proof system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have