Generalized PCP is decidable for marked morphisms

DOI10.1007/3-540-48321-7_25MaRDI QIDQ4934339zbMATH OpenFDO

Authors Vesa Halava, Tero Harju, Mika Hirvensalo

Publication date 3 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48321-7_25

zbMATH Keywords

generalized post correspondence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Generalized Post correspondence problem for marked morphisms
• Some new results on Post correspondence problem and its modifications
• scientific article; zbMATH DE number 1522564
• Binary (generalized) Post Correspondence Problem
• Remarks on generalized Post Correspondence Problem

Cited in

(4)

• Binary (generalized) Post Correspondence Problem
• Generalized Post correspondence problem for marked morphisms
• scientific article; zbMATH DE number 1522564 (Why is no real title available?)
• Marked PCP is decidable

This page was built for publication: Generalized PCP is decidable for marked morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934339)