{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:22:58Z","timestamp":1742962978967,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_31","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"396-407","source":"Crossref","is-referenced-by-count":2,"title":["Large Simple Binary Equality Words"],"prefix":"10.1007","author":[{"given":"Jana","family":"Hadravov\u00e1","sequence":"first","affiliation":[]},{"given":"\u0160t\u011bp\u00e1n","family":"Holub","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"127","volume":"4","author":"A. Salomaa","year":"1980","unstructured":"Salomaa, A.: Equality sets for homomorphisms of free monoid. Acta Cybern.\u00a04, 127\u2013139 (1980)","journal-title":"Acta Cybern."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/322123.322136","volume":"26","author":"K. \u010cul\u00edk II","year":"1979","unstructured":"\u010cul\u00edk II, K.: A purely homomorphic characterization of recursively enumerable sets. J. ACM\u00a026(2), 345\u2013350 (1979)","journal-title":"J. ACM"},{"key":"31_CR3","doi-asserted-by":"publisher","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. Bulletin of the American Mathematical Society\u00a052, 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-18088-5_12","volume-title":"Automata, Languages and Programming","author":"J. Karhum\u00e4ki","year":"1987","unstructured":"Karhum\u00e4ki, J.: On recent trends in formal language theory. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 136\u2013162. Springer, Heidelberg (1987)"},{"key":"31_CR5","unstructured":"Karhum\u00e4ki, J.: Open problems and exercises on words and languages (invited talk). In: Proceedings of Conference on Algebraic Information, Aristotle University of Thessaloniki, pp. 295\u2013305 (2005)"},{"issue":"4","key":"31_CR6","first-page":"349","volume":"14","author":"I.K. \u010cul\u00edk","year":"1980","unstructured":"\u010cul\u00edk, I.K., Karhum\u00e4ki, J.: On the equality sets for homomorphisms on free monoids with two generators. ITA\u00a014(4), 349\u2013369 (1980)","journal-title":"ITA"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0021-8693(83)90119-9","volume":"85","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Karhum\u00e4ki, J., Rozenberg, G.: On binary equality sets and a solution to the test set conjecture in the binary case. J. Algebra\u00a085(1), 76\u201385 (1983)","journal-title":"J. Algebra"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0021-8693(02)00534-3","volume":"259","author":"\u0160. Holub","year":"2003","unstructured":"Holub, \u0160.: Binary equality sets are generated by two words. Journal of Algebra\u00a0259, 1\u201342 (2003)","journal-title":"Journal of Algebra"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Holub, \u0160.: A unique structure of two-generated binary equality sets. In: Developments in Language Theory, pp. 245\u2013257 (2002)","DOI":"10.1007\/3-540-45005-X_21"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"Languages and Compilers for Parallel Computing","author":"\u0160. Holub","year":"1998","unstructured":"Holub, \u0160.: Binary equality languages for periodic morphisms. In: Huang, C.-H., Sadayappan, P., Sehr, D. (eds.) LCPC 1997. LNCS, vol.\u00a01366, pp. 52\u201354. Springer, Heidelberg (1998)"},{"issue":"2","key":"31_CR11","first-page":"273","volume":"4","author":"J. Ma\u0148uch","year":"2001","unstructured":"Ma\u0148uch, J.: Defect effect of bi-infinite words in the two-element case. Discrete Mathematics and Theoretical Computer Science\u00a04(2), 273\u2013290 (2001)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(89)90080-7","volume":"21","author":"A. Ehrenfeucht","year":"1982","unstructured":"Ehrenfeucht, A., Karhum\u00e4ki, J., Rozenberg, G.: The (generalized) Post Correspondence Problem with lists consisting of two words is decidable. Theor. Comput. Sci.\u00a021, 119\u2013144 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR13","unstructured":"Halava, V., Holub, \u0160.: Binary (generalized) Post Correspondence Problem is in P. Technical Report 785, TUCS (September 2006)"},{"key":"31_CR14","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)"},{"key":"31_CR15","series-title":"word, language, grammar","volume-title":"Handbook of formal languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of formal languages. word, language, grammar, vol.\u00a01. Springer, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:59:22Z","timestamp":1676055562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}