Abstract
We consider transducers with set output, i.e., finite state machines which produce a set of output symbols upon reading any input symbol. When a word consisting of input symbols is read, the union of corresponding output sets is produced. Such transducers are instrumental in some important data classification tasks, such as multi-field packet classification. Two transducers are called equivalent if they produce equal output upon reading any input word. In practical data classification applications, it is important to store in memory only one transducer of every equivalence class, in order to save memory space. This yields the need of finding, in any equivalence class, one transducer, called canonical which is easy to compute, given any transducer from this class. One of the results of this paper is the construction of an algorithm which completes this task. Assuming that the input and output alphabets are of bounded size, for a given n-state transducer T, our algorithm finds the canonical transducer Ψ(T) equivalent to T in time O(nlogn).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Azgani, S.: Using content-addressable memory for networking applications. Communications Systems Design 5 (1999)
Jenkins, C.: Speed and throughput of programable state machines for classification of OC192 data. In: Network Processors Conference, San Jose, California (2000) 6–24
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press (1974)
Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23 (1997) 269–311
Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234 (2000) 177–201
Gupta, P., McKeown, N.: Packet classification on multiple fields. In: SIGCOMM. (1999) 147–160
Lakshman, T.V., Stiliadis, D.: High-speed policy-based packet forwarding using efficient multi-dimensional range matching. In: SIGCOMM. (1998) 203–214
Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1 (1972) 146–160
Tarjan, R.E.: Finding dominators in directed graphs. SIAM Journal on Computing 3 (1974) 62–89
Revuz, D.: Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France (1991) LITP 91.44.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czyzowicz, J., Fraczak, W., Pelc, A. (2002). Transducers with Set Output. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_33
Download citation
DOI: https://doi.org/10.1007/3-540-45655-4_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43996-7
Online ISBN: 978-3-540-45655-1
eBook Packages: Springer Book Archive