{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:17Z","timestamp":1725662897127},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_26","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:39Z","timestamp":1330192959000},"page":"292-302","source":"Crossref","is-referenced-by-count":1,"title":["On three-element codes"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"26_CR1","unstructured":"Berstel, J. and Perrin, D., The Theory of Codes, (to appear)."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0019-9958(65)90300-1","volume":"8","author":"S. Colomb","year":"1965","unstructured":"Colomb, S. and Gordon, B., Codes with bounded synchronization delay, Inform. and Control 8 (1965), 355\u2013372.","journal-title":"Inform. and Control"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Karhum\u00e4ki, J., A property of three-element codes, Proceedings of STACS84, Lecture Notes in Computer Science (Springer, 1984).","DOI":"10.1007\/3-540-12920-0_28"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Karhum\u00e4ki, J., The Ehrenfeucht Conjecture: A compactness claim for finitely generated free monoids, Theoret. Comput. Sci. (to appear).","DOI":"10.1016\/0304-3975(84)90004-5"},{"key":"26_CR5","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M., Combinatorics on Words, Addison-Wesley, Reading, Mass (1983)."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(79)90164-X","volume":"27","author":"A. Luca De","year":"1979","unstructured":"De Luca, A., Perrin, D., Restivo, A. and Termini, S., Synchronization and simplification, Discrete Math. 27 (1979) 297\u2013308.","journal-title":"Discrete Math."},{"key":"26_CR7","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"Salomaa, A., Jewels of Formal Language Theory, Computer Science Press, Rochville, Maryland (1981)."},{"key":"26_CR8","volume-title":"Une theorie algebraique du codage, Seminaire Dubreil-Pisot, annee 55\u201356, exp. n. 15 Inst.","author":"M. P. Sch\u00fctzenberger","year":"1956","unstructured":"Sch\u00fctzenberger, M.P., Une theorie algebraique du codage, Seminaire Dubreil-Pisot, annee 55\u201356, exp. n. 15 Inst. Henri Poincare, Paris (1956)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:15Z","timestamp":1605643635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}