Verification of PCP-Related Computational Reductions in Coq
Logic in Computer Science
2022-12-09 v2 Formal Languages and Automata Theory
Abstract
We formally verify several computational reductions concerning the Post correspondence problem (PCP) using the proof assistant Coq. Our verifications include a reduction of a string rewriting problem generalising the halting problem for Turing machines to PCP, and reductions of PCP to the intersection problem and the palindrome problem for context-free grammars. Interestingly, rigorous correctness proofs for some of the reductions are missing in the literature.
Keywords
Cite
@article{arxiv.1711.07023,
title = {Verification of PCP-Related Computational Reductions in Coq},
author = {Yannick Forster and Edith Heiter and Gert Smolka},
journal= {arXiv preprint arXiv:1711.07023},
year = {2022}
}