{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:41Z","timestamp":1725517181659},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_9","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"120-131","source":"Crossref","is-referenced-by-count":2,"title":["Shortest Synchronizing Strings for Huffman Codes"],"prefix":"10.1007","author":[{"given":"Marek Tomasz","family":"Biskup","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/18.9779","volume":"34","author":"R.M. Capocelli","year":"1988","unstructured":"Capocelli, R.M., Gargano, L., Vaccaro, U.: On the characterization of statistically synchronizable variable-length codes. IEEE Trans. Inform. Theory\u00a034(4), 817\u2013825 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"9_CR2","doi-asserted-by":"publisher","first-page":"2219","DOI":"10.1109\/TIT.2003.815803","volume":"49","author":"C.F. Freiling","year":"2003","unstructured":"Freiling, C.F., Jungreis, D.S., Theberge, F., Zeger, K.: Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inform. Theory\u00a049(9), 2219\u20132225 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/S0019-9958(67)90620-1","volume":"11","author":"M.P. Sch\u00fctzenberger","year":"1967","unstructured":"Sch\u00fctzenberger, M.P.: On synchronizing prefix codes. Information and Control\u00a011(4), 396\u2013401 (1967)","journal-title":"Information and Control"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TIT.1971.1054657","volume":"17","author":"B. Rudner","year":"1971","unstructured":"Rudner, B.: Construction of minimum-redundancy codes with an optimum synchronizing property. IEEE Trans. Inform. Theory\u00a017(4), 478\u2013487 (1971)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0012-365X(99)90127-9","volume":"197-198","author":"S. Perkins","year":"1999","unstructured":"Perkins, S., Escott, A.E.: Synchronizing codewords of q-ary Huffman codes. Discrete Math.\u00a0197-198, 637\u2013655 (1999)","journal-title":"Discrete Math."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/ITCC.2003.1197531","volume-title":"ITCC 2003: Proceedings of the International Conference on Information Technology: Computers and Communications","author":"Y.M. Huang","year":"2003","unstructured":"Huang, Y.M., Wu, S.C.: Shortest synchronizing codewords of a binary Huffman equivalent code. In: ITCC 2003: Proceedings of the International Conference on Information Technology: Computers and Communications, Washington, DC, USA, p. 226. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/18.119696","volume":"38","author":"R.M. Capocelli","year":"1992","unstructured":"Capocelli, R.M., Santis, A.D., Gargano, L., Vaccaro, U.: On the construction of statistically synchronizable codes. IEEE Trans. Inform. Theory\u00a038(2), 407\u2013414 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","volume":"30","author":"T.J. Ferguson","year":"1984","unstructured":"Ferguson, T.J., Rabinowitz, J.H.: Self-synchronizing Huffman codes. IEEE Trans. Inform. Theory\u00a030(4), 687\u2013693 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TIT.1985.1057110","volume":"31","author":"J.C. Maxted","year":"1985","unstructured":"Maxted, J.C., Robinson, J.P.: Error recovery for variable length codes. IEEE Trans. Inform. Theory\u00a031(6), 794\u2013801 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR10","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k. homog\u00e9nnym experimentom s konecn\u00fdmi automatmi. Mat. fyz.cas SAV\u00a014, 208\u2013215 (1964)","journal-title":"Mat. fyz.cas SAV"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"D.S. Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci.\u00a0330(1), 3\u201313 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on eulerian digraphs. Theor. Comput. Sci.\u00a0295(1-3), 223\u2013232 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","first-page":"535","volume":"17","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics\u00a017, 535\u2013548 (1983)","journal-title":"Annals of Discrete Mathematics"},{"issue":"1-2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2007.01.010","volume":"376","author":"D.S. Ananichev","year":"2007","unstructured":"Ananichev, D.S., Volkov, M.V., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci.\u00a0376(1-2), 30\u201341 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/11821069_68","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A.N. Trahtman","year":"2006","unstructured":"Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the \u010cern\u00fd conjecture. In: Kralovic, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 789\u2013800. Springer, Heidelberg (2006)"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D. Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput.\u00a019(3), 500\u2013510 (1990)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","first-page":"5","volume-title":"Model-Based Testing of Reactive Systems","author":"S. Sandberg","year":"2004","unstructured":"Sandberg, S.: Homing and Synchronizing Sequences. In: Broy, M., Jonsson, B., Katoen, J.P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:31:36Z","timestamp":1619523096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}