Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time (Q6154978)
From MaRDI portal
scientific article; zbMATH DE number 7805941
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time |
scientific article; zbMATH DE number 7805941 |
Statements
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time (English)
0 references
16 February 2024
0 references
binary Post's correspondence problem
0 references
periodic morphism
0 references
Isabelle/HOL
0 references
0 references
0 references
