Skip to main content
SpringerLink
Log in

Prime Decompositions of Regular Prefix Codes

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2608))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, Turku Centre for Computer Science (1998)

    Google Scholar 

  2. Azgani, S.: Using content-addressable memory for networking applications. Communications Systems Design 5 (1999)

    Google Scholar 

  3. Jenkins, C.: Speed and throughput of programable state machines for classification of OC192 data. In: Network Processors Conference, San Jose, California (2000) 6–24

    Google Scholar 

  4. Bruell, G.: Method and apparatus for defining data packet formats (1997) US Patent 5,680,585.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Labovitz, C., Malan, R., Jahanian, F.: Origins of internet routing instability. Technical Report CSE-TR-368-98, University of Michigan (1998)

    Google Scholar 

  8. Pin, J.E.: Variétés de langages formels. Masson, Paris (1984)

    MATH  Google Scholar 

  9. Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press (1974)

    Google Scholar 

  10. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)

    Google Scholar 

  11. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique, Université du Québec en Outaouais, Canada

    Jurek Czyzowicz & Andrzej Pelc

  2. Solidum Systems Corp, Ottawa, Canada

    Wojciech Fraczak

  3. Instytut Informatyki, Universytet Warszawski, Poland

    Wojciech Rytter

Authors
  1. Jurek Czyzowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Fraczak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, Université de Rouen, LIFAR, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud

  2. Departement Informatique, Laboratoire d’Informatique de l’Université de Tours École Polytechnique de l’Université de Tours, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation