Pages that link to "Item:Q792770"
From MaRDI portal
The following pages link to On some variants of Post's correspondence problem (Q792770):
Displaying 14 items.
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- The Post correspondence problem in groups. (Q471848) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- On complete one-way functions (Q734307) (← links)
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- P, NP, and the Post correspondence problem (Q1899905) (← links)
- (Q3778004) (← links)
- Remarks on generalized Post Correspondence Problem (Q4593916) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- (Q4790422) (← links)
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems (Q5458840) (← links)
- On bi-infinite and conjugate post correspondence problems (Q6186538) (← links)