{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:27Z","timestamp":1725484287519},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_33","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:37:01Z","timestamp":1179733021000},"page":"300-309","source":"Crossref","is-referenced-by-count":0,"title":["Transducers with Set Output"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Fraczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"33_CR1","unstructured":"Azgani, S.: Using content-addressable memory for networking applications. Communications Systems Design 5 (1999)"},{"key":"33_CR2","unstructured":"Jenkins, C.: Speed and throughput of programable state machines for classification of OC192 data. In: Network Processors Conference, San Jose, California (2000) 6\u201324"},{"key":"33_CR3","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"33_CR4","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press (1974)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"33_CR6","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23 (1997) 269\u2013311","journal-title":"Computational Linguistics"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234 (2000) 177\u2013201","journal-title":"Theoretical Computer Science"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, P., McKeown, N.: Packet classification on multiple fields. In: SIGCOMM. (1999) 147\u2013160","DOI":"10.1145\/316188.316217"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Lakshman, T.V., Stiliadis, D.: High-speed policy-based packet forwarding using efficient multi-dimensional range matching. In: SIGCOMM. (1998) 203\u2013214","DOI":"10.1145\/285237.285283"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1 (1972) 146\u2013160","journal-title":"SIAM Journal on Computing"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Finding dominators in directed graphs. SIAM Journal on Computing 3 (1974) 62\u201389","journal-title":"SIAM Journal on Computing"},{"key":"33_CR12","volume-title":"PhD thesis","author":"D. Revuz","year":"1991","unstructured":"Revuz, D.: Dictionnaires et lexiques: m\u00e9thodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France (1991) LITP 91.44."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:22:28Z","timestamp":1550334148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}