Flatwords and Post Correspondence Problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 992012 (Why is no real title available?)
- scientific article; zbMATH DE number 3989126 (Why is no real title available?)
- scientific article; zbMATH DE number 4028926 (Why is no real title available?)
- scientific article; zbMATH DE number 43879 (Why is no real title available?)
- scientific article; zbMATH DE number 107979 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3635491 (Why is no real title available?)
- scientific article; zbMATH DE number 604881 (Why is no real title available?)
- scientific article; zbMATH DE number 10092 (Why is no real title available?)
- A note on Post's correspondence problem
- A variant of a recursively unsolvable problem
- Equality Sets and Complexity Classes
- On F-prime solutions of the Post correspondence problem
- On simplest possible solutions for Post Correspondence Problems
- PCP-prime words and primality types
- Strongly prime PCP words
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
Cited in
(3)
This page was built for publication: Flatwords and Post Correspondence Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351939)