Abstract
One of the new approaches to data classification uses finite state automata for representation of prefix codes. An important task driven by the need for the efficient storage of such automata in memory is the decomposition of prefix codes into prime factors. We investigate properties of such prefix code decompositions. A linear time algorithm is designed which finds the prime decomposition F 1 F 2 . . . F k of a regular prefix code F given by its minimal deterministic automaton.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, Turku Centre for Computer Science (1998)
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
Bruell, G.: Method and apparatus for defining data packet formats (1997) US Patent 5,680,585.
Nossik, M., Welfeld, F., Richardson, M.: PAX PDL-a non-procedural packet description language. Online publication, Solidum Systems Corp, 1575 Carling Avenue, Ottawa, Ontario, Canada (1998) http://www.solidum.com/body/technology/pax-pdl/pax-pdl-00.html.
Czyzowicz, J., Fraczak, W., Iglewski, M., Welfeld, F.: PAX PDL-language for data communication packet description. Technical report, Solidum Systems Corp, 1575 Carling Avenue, Ottawa, Ontario, Canada (2001)
Labovitz, C., Malan, R., Jahanian, F.: Origins of internet routing instability. Technical Report CSE-TR-368-98, University of Michigan (1998)
Pin, J.E.: Variétés de langages formels. Masson, Paris (1984)
Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press (1974)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W. (2003). Prime Decompositions of Regular Prefix Codes. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive