The (generalized) post correspondence problem with lists consisting of two words is decidable
Open Access
- 30 November 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 21 (2) , 119-144
- https://doi.org/10.1016/0304-3975(89)90080-7
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Equality Sets and Complexity ClassesSIAM Journal on Computing, 1980
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable LanguagesJournal of the ACM, 1980
- On the equality sets for homomorphisms on free monoids with two generatorsRAIRO. Informatique théorique, 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