{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:07Z","timestamp":1725730567227},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_16","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"167-178","source":"Crossref","is-referenced-by-count":2,"title":["On the Dual Post Correspondence Problem"],"prefix":"10.1007","author":[{"given":"Joel D.","family":"Day","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Reidenbach","sequence":"additional","affiliation":[]},{"given":"Johannes C.","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. Culik II.","year":"1979","unstructured":"Culik II., K.: A purely homomorphic characterization of recursively enumerable sets. Journal of the ACM\u00a026, 345\u2013350 (1979)","journal-title":"Journal of the ACM"},{"key":"16_CR2","first-page":"349","volume":"14","author":"K. Culik II","year":"1980","unstructured":"Culik II, K., Karhum\u00e4ki, J.: On the equality sets for homomorphisms on free monoids with two generators. Theoretical Informatics and Applications (RAIRO)\u00a014, 349\u2013369 (1980)","journal-title":"Theoretical Informatics and Applications (RAIRO)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1142\/S0129054107005212","volume":"18","author":"E. Czeizler","year":"2007","unstructured":"Czeizler, E., Holub, \u0160., Karhum\u00e4ki, J., Laine, M.: Intricacies of simple word equations: An example. International Journal of Foundations of Computer Science\u00a018, 1167\u20131175 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/S0019-9958(79)90082-2","volume":"43","author":"J. Engelfriet","year":"1979","unstructured":"Engelfriet, J., Rozenberg, G.: Equality languages and fixed point languages. Information and Control\u00a043, 20\u201349 (1979)","journal-title":"Information and Control"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2012.04.045","volume":"448","author":"D.D. Freydenberger","year":"2012","unstructured":"Freydenberger, D.D., Nevisi, H., Reidenbach, D.: Weakly unambiguous morphisms. Theoretical Computer Science\u00a0448, 21\u201340 (2012)","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1142\/S0129054106004017","volume":"17","author":"D.D. Freydenberger","year":"2006","unstructured":"Freydenberger, D.D., Reidenbach, D., Schneider, J.C.: Unambiguous morphic images of strings. International Journal of Foundations of Computer Science\u00a017, 601\u2013628 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1142\/S0129054112500207","volume":"23","author":"J. Hadravov\u00e1","year":"2012","unstructured":"Hadravov\u00e1, J., Holub, \u0160.: Large simple binary equality words. International Journal of Foundations of Computer Science\u00a023, 1385\u20131403 (2012)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR8","unstructured":"Karhum\u00e4ki, J., Petre, E.: On some special equations on words. Technical Report 583, Turku Centre for Computer Science, TUCS (2003), \n                    \n                      http:\/\/tucs.fi:8080\/publications\/insight.php?id=tKaPe03a"},{"key":"16_CR9","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/inco.1995.1128","volume":"121","author":"A. Mateescu","year":"1995","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: P, NP, and the Post Correspondence Problem. Information and Computation\u00a0121, 135\u2013142 (1995)","journal-title":"Information and Computation"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society\u00a052, 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1016\/j.tcs.2009.01.020","volume":"410","author":"D. Reidenbach","year":"2009","unstructured":"Reidenbach, D., Schneider, J.C.: Morphically primitive words. Theoretical Computer Science\u00a0410, 2148\u20132161 (2009)","journal-title":"Theoretical Computer Science"},{"key":"16_CR13","first-page":"127","volume":"4","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A.: Equality sets for homomorphisms of free monoids. Acta Cybernetica\u00a04, 127\u2013139 (1978)","journal-title":"Acta Cybernetica"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1051\/ita\/2009020","volume":"44","author":"J.C. Schneider","year":"2010","unstructured":"Schneider, J.C.: Unambiguous erasing morphisms in free monoids. Theoretical Informatics and Applications (RAIRO)\u00a044, 193\u2013208 (2010)","journal-title":"Theoretical Informatics and Applications (RAIRO)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:19:59Z","timestamp":1557793199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}