Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems

  • Pierre Chambart
  • Philippe Schnoebelen
Conference paper

DOI: 10.1007/978-3-540-77050-3_22

Volume 4855 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chambart P., Schnoebelen P. (2007) Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. In: Arvind V., Prasad S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg

Abstract

We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg, a further variant where solutions are constrained and must belong to a given regular language. PEPreg is decidable but not primitive recursive. This entails the decidability of reachability for unidirectional systems with one reliable and one lossy channel.

Keywords

Post correspondence problem Lossy channel systems Higman’s Lemma 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Pierre Chambart
    • 1
  • Philippe Schnoebelen
    • 1
  1. 1.LSV, ENS Cachan, CNRS, 61, av. Pdt. Wilson, F-94230 CachanFrance