{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:34:06Z","timestamp":1648784046612},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00092-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"93-108","source":"Crossref","is-referenced-by-count":2,"title":["Flatwords and Post Correspondence Problem"],"prefix":"10.1016","volume":"161","author":[{"given":"Tero","family":"Harju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marjo","family":"Lipponen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Mateescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00092-5_BIB1","series-title":"Concurrent Programming Fundamental Techniques for Real-Time and Parallel Software Design","author":"Axford","year":"1989"},{"key":"10.1016\/0304-3975(95)00092-5_BIB2","first-page":"49","article-title":"Representing complexity classes by equality sets","volume":"Vol. 71","author":"Book","year":"1979"},{"key":"10.1016\/0304-3975(95)00092-5_BIB3","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/0209057","article-title":"Equality sets and complexity classes","volume":"9","author":"Book","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00092-5_BIB4","first-page":"54","article-title":"Some remarks on PCP(k) and related problems","volume":"12","author":"Claus","year":"1980","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(95)00092-5_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(95)00092-5_BIB6","series-title":"The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science","author":"Golan","year":"1992"},{"key":"10.1016\/0304-3975(95)00092-5_BIB7","unstructured":"J.S. Golan, A. Mateescu and D. Vaida, Towards a unified theory of sequential, parallel and semi-parallel processes, submitted."},{"key":"10.1016\/0304-3975(95)00092-5_BIB8","series-title":"Graphs and Algorithms","author":"Gondram","year":"1984"},{"key":"10.1016\/0304-3975(95)00092-5_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(89)90080-7","article-title":"The (generalized) Post Correspondence Problem with lists consisting of two words is decidable","volume":"21","author":"Ehrenfeucht","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00092-5_BIB10","series-title":"Proc. 14th ICALP","first-page":"138","article-title":"On recent trends in formal language theory","volume":"Vol. 267","author":"Karhum\u00e4ki","year":"1987"},{"key":"10.1016\/0304-3975(95)00092-5_BIB11","first-page":"217","article-title":"Primitive Words and Languages Associated to PCP","volume":"53","author":"Lipponen","year":"1994","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(95)00092-5_BIB12","doi-asserted-by":"crossref","unstructured":"M. Lipponen, Post Correspondence Problem: words possible as primitive solutions, in: Proc. ICALP-95, (Springer, Berlin), to appear.","DOI":"10.1007\/3-540-60084-1_63"},{"key":"10.1016\/0304-3975(95)00092-5_BIB13","series-title":"Proc. 2nd Internat. Conf. on Developments in Language Theory","article-title":"On F-prime solutions of the Post Correspondence Problem","author":"Lipponen","year":"1995"},{"key":"10.1016\/0304-3975(95)00092-5_BIB14","doi-asserted-by":"crossref","unstructured":"M. Lipponen and Gh. P\u0103un, Strongly prime PCP words, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(95)00064-X"},{"key":"10.1016\/0304-3975(95)00092-5_BIB15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1051\/ita\/1993270100571","article-title":"PCP-prime words and primality types","volume":"27","author":"Mateescu","year":"1993","journal-title":"RAIRO Inform. Th\u00e9orique"},{"key":"10.1016\/0304-3975(95)00092-5_BIB16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01210595","article-title":"On simplest possible solutions for Post Correspondence Problems","volume":"30","author":"Mateescu","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(95)00092-5_BIB17","doi-asserted-by":"crossref","unstructured":"A. Mateescu, A. Salomaa, K. Salomaa and S. Yu, P, NP and Post Correspondence Problem, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1995.1128"},{"key":"10.1016\/0304-3975(95)00092-5_BIB18","first-page":"233","article-title":"A note on Post's Correspondence Problem","volume":"12","author":"Pansiot","year":"1981"},{"key":"10.1016\/0304-3975(95)00092-5_BIB19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","article-title":"A variant of a recursively unsolvable problem","volume":"53","author":"Post","year":"1946","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00092-5_BIB20","first-page":"226","article-title":"Primality types of instances of the Post Correspondence Problem","volume":"44","author":"Salomaa","year":"1991","journal-title":"EATCS Bull."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000925?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000925?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:53:38Z","timestamp":1555419218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595000925"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00092-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}