{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:55:07Z","timestamp":1743090907464},"reference-count":7,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1051\/ita\/2012015","type":"journal-article","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T19:55:45Z","timestamp":1340394945000},"page":"451-457","source":"Crossref","is-referenced-by-count":7,"title":["Undecidability of infinite post correspondence problem for instances of size 8"],"prefix":"10.1051","volume":"46","author":[{"given":"Jing","family":"Dong","sequence":"first","affiliation":[]},{"given":"Qinghui","family":"Liu","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2012,6,22]]},"reference":[{"key":"R1","unstructured":"Blondel V.D. and Canterini V., Undecidable problems for probabilistic automata of fixed dimension.Theor. Comput. Syst.36(2003) 231\u2013245."},{"key":"R2","unstructured":"Ehrenfeucht A., Karhum\u00e4ki J. and Rozenberg G., The (generalized) Post Correspondence Problem with lists consisting of two words is decidable.Theoret. Comput. Sci.21(1982) 119\u2013144."},{"key":"R3","unstructured":"Halava V. and Harju T., Undecibability of infinite Post Correspondence Problem for instances of size 9.RAIRO\u2013Theor. Inf. Appl.40(2006) 551\u2013557."},{"key":"R4","unstructured":"Halava V., Harju T. and Hirvensalo M., Binary (generalized) Post Correspondence Problem.Theoret. Comput. Sci.276(2002) 183\u2013204."},{"key":"R5","unstructured":"Matiyasevich Y. and S\u00e9nizergues G., Decision problems for semi-Thue systems with a few rules.Theoret. Comput. Sci.330(2005) 145\u2013169."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Post E., A variant of a recursively unsolvable problem.Bull. Amer. Math. Soc.52(1946) 264\u2013268.","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"R7","unstructured":"Ruohonen K., Reversible machines and Posts Correspondence Problem for biprefix morphisms.J. Inform. Process. Cybernet.EIK21(1985) 579\u2013595."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2012015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T06:12:42Z","timestamp":1561875162000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2012015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,22]]},"references-count":7,"journal-issue":{"issue":"3"},"alternative-id":["ita110035"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2012015","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,22]]}}}