Skip to main content
SpringerLink
Log in

Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality

  • Conference paper
Combinatorial Pattern Matching (CPM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6129))

Included in the following conference series:

Abstract

We present an algorithm for constructing the minimal automaton recognizing A * X, where the pattern X is a set of m (that is a fixed integer) non-empty words over a finite alphabet A whose sum of lengths is n. This algorithm, inspired by Brzozowski’s minimization algorithm, uses sparse lists to achieve a linear time complexity with respect to n.

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. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Communications of the ACM 18(6), 333–340 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  3. Béal, M.P., Crochemore, M.: Minimizing local automata. In: Caire, G., Fossorier, M. (eds.) IEEE International Symposium on Information Theory (ISIT 2007), 07CH37924C, pp. 1376–1380. IEEE Catalog (2007)

    Google Scholar 

  4. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM 20(10), 62–72 (1977)

    Article  Google Scholar 

  5. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y (1962)

    Google Scholar 

  6. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 pages. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  7. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)

    Book  Google Scholar 

  8. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of Machines and computations, pp. 189–196. Academic Press, London (1971)

    Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Introduction To Automata Theory, Languages, And Computation. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)

    Google Scholar 

  10. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing 6(2), 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mohri, M.: String-matching with automata. Nordic Journal of Computing 4(2), 217–231 (Summer 1997)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIPN UMR 7030, Université Paris 13 - CNRS, 93430, Villetaneuse, France

    Omar AitMous & Frédérique Bassino

  2. LIGM, UMR CNRS 8049, Université Paris-Est, 77454, Marne-la-Vallée, France

    Cyril Nicaud

Authors
  1. Omar AitMous
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frédérique Bassino
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cyril Nicaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA, and Bar-Ilan University, 52900, Ramat-Gan, Israel

    Amihood Amir

  2. IBM T.J. Watson Research Center, Yorktown Heights, NY, USA

    Laxmi Parida

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

AitMous, O., Bassino, F., Nicaud, C. (2010). Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality. In: Amir, A., Parida, L. (eds) Combinatorial Pattern Matching. CPM 2010. Lecture Notes in Computer Science, vol 6129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13509-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13509-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13508-8

  • Online ISBN: 978-3-642-13509-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation