On the (generalized) post correspondence problem with lists of length 2
- 1 January 1981
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 408-416
- https://doi.org/10.1007/3-540-10843-2_33
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Equality Sets and Complexity ClassesSIAM Journal on Computing, 1980
- A Purely Homomorphic Characterization of Recursively Enumerable SetsJournal of the ACM, 1979
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946