Post correspondence problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Post correspondence problem" in English language version.

refsWebsite

Global rank English rank

9doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

1ams.org

451^st place

277^th place

1zbmath.org

1,923^rd place

1,068^th place

1dagstuhl.de

low place

1archive.org

6^th place

1umich.edu

459^th place

360^th place

1handle.net

102^nd place

76^th place

1ens-cachan.fr

low place

1arxiv.org

69^th place

59^th place

ams.org

E. L. Post (1946). "A variant of a recursively unsolvable problem" (PDF). Bull. Amer. Math. Soc. 52 (4): 264–269. doi:10.1090/s0002-9904-1946-08555-9. S2CID 122948861.

archive.org

Michael R. Garey; David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman. p. 228. ISBN 0-7167-1045-5.

arxiv.org

Paul C. Bell; Igor Potapov (2010). "On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups". International Journal of Foundations of Computer Science. 21 (6). World Scientific: 963–978. arXiv:0902.1975. doi:10.1142/S0129054110007660.

dagstuhl.de

drops.dagstuhl.de

T. Neary (2015). "Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words". In Ernst W. Mayr and Nicolas Ollinger (ed.). 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). STACS 2015. Vol. 30. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. pp. 649–661. doi:10.4230/LIPIcs.STACS.2015.649.

doi.org

E. L. Post (1946). "A variant of a recursively unsolvable problem" (PDF). Bull. Amer. Math. Soc. 52 (4): 264–269. doi:10.1090/s0002-9904-1946-08555-9. S2CID 122948861.
Ehrenfeucht, A.; Karhumäki, J.; Rozenberg, G. (November 1982). "The (generalized) post correspondence problem with lists consisting of two words is decidable". Theoretical Computer Science. 21 (2): 119–144. doi:10.1016/0304-3975(89)90080-7.
T. Neary (2015). "Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words". In Ernst W. Mayr and Nicolas Ollinger (ed.). 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). STACS 2015. Vol. 30. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. pp. 649–661. doi:10.4230/LIPIcs.STACS.2015.649.
K. Ruohonen (1983). "On some variants of Post's correspondence problem". Acta Informatica. 19 (4). Springer: 357–367. doi:10.1007/BF00290732. S2CID 20637902.
Y. Gurevich (1991). "Average case completeness" (PDF). J. Comput. Syst. Sci. 42 (3). Elsevier Science: 346–398. doi:10.1016/0022-0000(91)90007-R. hdl:2027.42/29307.
V. Halava; M. Hirvensalo; R. de Wolf (2001). "Marked PCP is decidable". Theor. Comput. Sci. 255 (1–2). Elsevier Science: 193–204. doi:10.1016/S0304-3975(99)00163-2.
P. Chambart; Ph. Schnoebelen (2007). Post embedding problem is not primitive recursive, with applications to channel systems (PDF). Lecture Notes in Computer Science. Vol. 4855. Springer. pp. 265–276. doi:10.1007/978-3-540-77050-3_22. ISBN 978-3-540-77049-7.
Paul C. Bell; Igor Potapov (2010). "On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups". International Journal of Foundations of Computer Science. 21 (6). World Scientific: 963–978. arXiv:0902.1975. doi:10.1142/S0129054110007660.

dx.doi.org

Ehrenfeucht, A.; Karhumäki, J.; Rozenberg, G. (November 1982). "The (generalized) post correspondence problem with lists consisting of two words is decidable". Theoretical Computer Science. 21 (2): 119–144. doi:10.1016/0304-3975(89)90080-7.

ens-cachan.fr

lsv.ens-cachan.fr

P. Chambart; Ph. Schnoebelen (2007). Post embedding problem is not primitive recursive, with applications to channel systems (PDF). Lecture Notes in Computer Science. Vol. 4855. Springer. pp. 265–276. doi:10.1007/978-3-540-77050-3_22. ISBN 978-3-540-77049-7.

handle.net

hdl.handle.net

Y. Gurevich (1991). "Average case completeness" (PDF). J. Comput. Syst. Sci. 42 (3). Elsevier Science: 346–398. doi:10.1016/0022-0000(91)90007-R. hdl:2027.42/29307.

semanticscholar.org

api.semanticscholar.org

E. L. Post (1946). "A variant of a recursively unsolvable problem" (PDF). Bull. Amer. Math. Soc. 52 (4): 264–269. doi:10.1090/s0002-9904-1946-08555-9. S2CID 122948861.
K. Ruohonen (1983). "On some variants of Post's correspondence problem". Acta Informatica. 19 (4). Springer: 357–367. doi:10.1007/BF00290732. S2CID 20637902.

umich.edu

deepblue.lib.umich.edu

Y. Gurevich (1991). "Average case completeness" (PDF). J. Comput. Syst. Sci. 42 (3). Elsevier Science: 346–398. doi:10.1016/0022-0000(91)90007-R. hdl:2027.42/29307.

zbmath.org

Salomaa, Arto (1981). Jewels of Formal Language Theory. Pitman Publishing. pp. 74–75. ISBN 0-273-08522-0. Zbl 0487.68064.