Problème de correspondance de Post (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problème de correspondance de Post" in French language version.

refsWebsite

Global rank French rank

7doi.org

2^nd place

3^rd place

1ams.org

451^st place

1,058^th place

1dagstuhl.de

low place

ams.org

(en) E. L. Post, « A variant of a recursively unsolvable problem », Bull. Amer. Math. Soc, vol. 52,‎ 1946 (lire en ligne)

dagstuhl.de

drops.dagstuhl.de

(en) T. Neary « Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words » (2015) (DOI 10.4230/LIPIcs.STACS.2015.649, lire en ligne)
— « (ibid.) », dans 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, p. 649–661

doi.org

dx.doi.org

(en) A. Ehrenfeucht, J. Karhumäki et G. Rozenberg, « The (generalized) post correspondence problem with lists consisting of two words is decidable », Theoretical Computer Science, vol. 21, n^o 2,‎ novembre 1982, p. 119–144 (DOI 10.1016/0304-3975(89)90080-7, lire en ligne)
(en) T. Neary « Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words » (2015) (DOI 10.4230/LIPIcs.STACS.2015.649, lire en ligne)
— « (ibid.) », dans 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, p. 649–661
(en) K. Ruohonen, « On some variants of Post's correspondence problem », Acta Informatica, Springer, vol. 19, n^o 4,‎ 1983, p. 357–367 (DOI 10.1007/BF00290732)
(en) Y. Gurevich, « Average case completeness », J. Comp. Sys. Sci., Elsevier Science, vol. 42, n^o 3,‎ 1991, p. 346–398 (DOI 10.1016/0022-0000(91)90007-R)
(en) V. Halava, « Marked PCP is decidable », Theor. Comp. Sci., Elsevier Science, vol. 255,‎ 2001, p. 193–204 (DOI 10.1016/S0304-3975(99)00163-2)
(en) P. Chambart, « Post embedding problem is not primitive recursive, with applications to channel systems », Lecture Notes in Computer Science, Springer, vol. 4855,‎ 2007, p. 265–276 (ISBN 978-3-540-77049-7, DOI 10.1007/978-3-540-77050-3_22)
(en) Paul C. Bell, « On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups », International Journal of Foundations of Computer Science, World Scientific, vol. 21.6,‎ 2010, p. 963-978 (DOI 10.1142/S0129054110007660)