{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:21:14Z","timestamp":1737091274047,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_2","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T23:45:05Z","timestamp":1180223105000},"page":"13-26","source":"Crossref","is-referenced-by-count":2,"title":["Cascade Decompositions are Bit-Vector Algorithms"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"2_CR1","unstructured":"A. Bergeron and S. Hamel, Vector Algorithms for Approximate String Matching (to appear in IJFCS)."},{"key":"2_CR2","unstructured":"A. Bergeron and S. Hamel, Cascade Decompositions are Bit-Vector Algorithms, http:\/\/www.lacim.uqam.ca\/~anne ."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"K. Krohn and J. L. Rhodes, Algebraic Theory of machines, Transactions of the American Mathematical Society, 116, (1965), 450\u2013464.","DOI":"10.2307\/1994127"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"O. Maler and A. Pnueli, Tight Bounds on the Complexity of Cascaded Decomposition Theorem, 31st Annual Symposium on Foundations of Computer Science IEEE, volume II, (1990), 672\u2013682.","DOI":"10.1109\/FSCS.1990.89589"},{"key":"2_CR5","unstructured":"O. Maler and A. Pnueli, On the Cascaded Decomposition of Automata, its Complexity and its Application to Logic, unpublished manuscript available at http:\/\/www-verimag.imag.fr\/PEOPLE\/maler\/uabst.html , (1994), 48 pages."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46-3","author":"E. Myers","year":"1999","unstructured":"E. Myers, A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming, J. ACM, 46-3, (1999) 395\u2013415.","journal-title":"J. ACM"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"J. Stern, Complexity of some Problems from the Theory of Automata, Information and Control, 66, (1985), 163\u2013176.","journal-title":"Information and Control"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0019-9958(67)90228-8","volume":"10","author":"H. P. Zeiger","year":"1967","unstructured":"H. P. Zeiger, Cascade Synthesis of Finite-State Machines, Information and Control, 10, (1967), 419\u2013433.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:23:36Z","timestamp":1737051816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}