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. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Chambart, P., & Schnoebelen, P. (2007). Post embedding problem is not primitive recursive, with applications to channel systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4855 LNCS, pp. 265–276). Springer Verlag. https://doi.org/10.1007/978-3-540-77050-3_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
