{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T02:08:21Z","timestamp":1748052501415},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_50","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"568-579","source":"Crossref","is-referenced-by-count":23,"title":["The Complexity of Finding Reset Words in Finite Automata"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Olschewski","sequence":"first","affiliation":[]},{"given":"Michael","family":"Ummels","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-13182-0_4","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.V. Berlinkov","year":"2010","unstructured":"Berlinkov, M.V.: Approximating the length of synchronizing words. In: Ablayev, F., Mayr, E.W. (eds.) Computer Science \u2013 Theory and Applications. LNCS, vol.\u00a06072, pp. 37\u201347. Springer, Heidelberg (2010)"},{"issue":"3","key":"50_CR2","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. Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied\u00a014(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzikalny \u010casopis Slovensk. Akad. Vied"},{"issue":"4","key":"50_CR3","first-page":"289","volume":"7","author":"J. \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerov\u00e1, B.: On directable automata. Kybernetica\u00a07(4), 289\u2013298 (1971)","journal-title":"Kybernetica"},{"issue":"3","key":"50_CR4","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 Journal on Computing\u00a019(3), 500\u2013510 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR5","unstructured":"Gawrychowski, P.: Complexity of shortest synchronizing word. Unpublished manuscript (April 2008)"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"M.W. Krentel","year":"1988","unstructured":"Krentel, M.W.: The complexity of optimization problems. Journal of Computer and System Sciences\u00a036, 490\u2013509 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR7","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)"},{"key":"50_CR8","first-page":"535","volume":"17","author":"J.-\u00c9. Pin","year":"1983","unstructured":"Pin, J.-\u00c9.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics\u00a017, 535\u2013548 (1983)","journal-title":"Annals of Discrete Mathematics"},{"key":"50_CR9","unstructured":"Samotij, W.: A note on the complexity of the problem of finding shortest synchronizing words. In: Proc. AutoMathA 2007, University of Palermo, CD (2007)"},{"issue":"2","key":"50_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","volume":"48","author":"A.L. Selman","year":"1994","unstructured":"Selman, A.L.: A taxonomy of complexity classes of functions. Journal of Computer and System Sciences\u00a048(2), 357\u2013381 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"50_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:47Z","timestamp":1606186907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}