{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:07:21Z","timestamp":1767910041954,"version":"3.49.0"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1007\/bf01210595","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T10:38:42Z","timestamp":1109241522000},"page":"441-457","source":"Crossref","is-referenced-by-count":4,"title":["On simplest possible solutions for Post Correspondence Problems"],"prefix":"10.1007","volume":"30","author":[{"given":"Alexandru","family":"Mateescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. Culik","year":"1979","unstructured":"Culik, K.: A purely homomorphic characterization of recursively enumerable languages. J. Assoc. Comput. Mach.26, 345?350 (1979)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR2","unstructured":"Mateescu, A., Salomaa, A.: PCP-prime words and primality types. RAIRO\/Theor. Comput. Sci. (to appear)"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E. Post","year":"1946","unstructured":"Post, E.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc.52, 264?268 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"CR4","volume-title":"Jewels of formal language theory","author":"A. Salomaa","year":"1981","unstructured":"Salomaa, A.: Jewels of formal language theory. Oxford: Computer Science Press 1981"},{"key":"CR5","first-page":"226","volume":"44","author":"A. Salomaa","year":"1991","unstructured":"Salomaa, A., Salomaa, K., Yu, Sheng: Primality types of instances of the Post Correspondence Problem. EATCS Bull.44, 226?241 (1991)","journal-title":"EATCS Bull."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01210595.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01210595\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01210595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:40:35Z","timestamp":1556775635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01210595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01210595"],"URL":"https:\/\/doi.org\/10.1007\/bf01210595","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}