On some variants of Post's Correspondence Problem
Author:
- 1 September 1983
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 19 (4) , 357-367
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The (generalized) post correspondence problem with lists consisting of two words is decidableTheoretical Computer Science, 1982
- A note on post's correspondence problemInformation Processing Letters, 1981
- Generalized Parikh mappings and homomorphismsInformation and Control, 1980
- A useful device for showing the solvability of some decision problems1976
- A Remark on Code Sets and Context-Free LanguagesIEEE Transactions on Computers, 1975