Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 265-276
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Non-primitive recursive decidability of products of modal logics with expanding domainsAnnals of Pure and Applied Logic, 2006
- Simulating perfect channels with probabilistic lossy channelsInformation and Computation, 2005
- Temporal Logics over Transitive StatesLecture Notes in Computer Science, 2005
- Decidability and Complexity Results for Timed Automata via Channel MachinesLecture Notes in Computer Science, 2005
- Alternating Timed Automata2005
- Bisimulation and Other Undecidable Equivalences for Lossy Channel SystemsLecture Notes in Computer Science, 2001
- Marked PCP is decidableTheoretical Computer Science, 2001
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- On some variants of Post's Correspondence ProblemActa Informatica, 1983