Remarks on generalized Post Correspondence Problem

DOI10.1007/3-540-60922-9_4zbMath1379.03009OpenAlexW1581057604MaRDI QIDQ4593916

Daniel Krob, Juhani Karhumäki, Tero J.Harju

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_4

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Related Items (5)

On Boolean closed full trios and rational Kripke frames ⋮ Post correspondence problem for short words ⋮ Marked PCP is decidable ⋮ Undecidability of infinite post correspondence problem for instances of Size 9 ⋮ Binary (generalized) Post Correspondence Problem

This page was built for publication: Remarks on generalized Post Correspondence Problem