{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:54Z","timestamp":1725663834593},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:09:15Z","timestamp":1330258155000},"page":"174-184","source":"Crossref","is-referenced-by-count":0,"title":["Post Correspondence Problem: Primitivity and interrelations with complexity classes"],"prefix":"10.1007","author":[{"given":"Alexandru","family":"Mateescu","sequence":"first","affiliation":[]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. Culik","year":"1979","unstructured":"K. Culik. A purely homomorphic characterization of recursively enumerable languages. Journal of the Association for Computing Machinery 26(1979) 345\u2013350.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"11_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1051\/ita\/1993270100571","volume":"27","author":"A. Mateescu","year":"1993","unstructured":"A. Mateescu and A. Salomaa. PCP \u2014 prime words and primality types. RAIRO\/ Theoretical Informatics and Applications, 27, 1 (1993) 57\u201370.","journal-title":"RAIRO\/ Theoretical Informatics and Applications"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. Mateescu and A. Salomaa. On simplest possible solutions for Post Correspondence Problems. Acta Informatica, to appear.","DOI":"10.1007\/BF01210595"},{"key":"11_CR4","unstructured":"A. Mateescu, A. Salomaa and Sheng Yu. P, NP and Post Correspondence Problem. Submitted for publication."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E. Post","year":"1946","unstructured":"E. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society\n52 (1946) 264\u2013268.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"11_CR6","unstructured":"A. Salomaa. Jewels of Formal Language Theory. Computer Science Press (1981)."},{"key":"11_CR7","first-page":"226","volume":"44","author":"A. Salomaa","year":"1991","unstructured":"A. Salomaa, K. Salomaa and Sheng Yu. Primality types of instances of the Post Correspondence Problem. EATCS Bulletin 44 (1991) 226\u2013241.","journal-title":"EATCS Bulletin"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:59:26Z","timestamp":1619571566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}