Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2006: Implementation and Application of Automata pp 114–125Cite as

Around Hopcroft’s Algorithm

  • Conference paper

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

Abstract

In this paper, a reflection is made on an indeterminism inherent to Hopcroft’s minimization algorithm: the splitter choice. We have implemented two natural policies (FIFO and FILO) for managing the set of splitters for which we obtain the following practical results: the FILO strategy performs better than the FIFO strategy, in the case of a one letter alphabet, the practical complexity in the FILO case never exceeds a linear one and our implementation is more efficient than the minimization algorithm of the FSM tool. This implementation is being integrated in a finite automata library, the Dash library. Thus, we present an efficient manner to manipulate automata by using canonical minimal automata.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beauquier, D., Berstel, J., Chrétienne, P.: Éléments d’Algorithmique, Masson (1992)

    Google Scholar 

  2. Berstel, J., Carton, O.: On the complexity of hopcroft’s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 35–44. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Baclet, M., Pagetti, C.: Around Hopcroft’s Algorithm. Technical Report LSV-06-12, Laboratoire Spécification et Vérification, ENS de Cachan, France (2006)

    Google Scholar 

  4. Baclet, M., Pacalet, R., Petit, A.: Register transfer level simulation. Technical Report LSV-04-10, Laboratoire Spécification et Vérification, ENS de Cachan, France (2004)

    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, New York (1962)

    Google Scholar 

  6. Couvreur, J.-M.: A BDD-like implementation of an automata package. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 310–311. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189–196. Academic Press, London (1971)

    Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  9. Klarlund, N., Møller, A.: MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus (January 2001)

    Google Scholar 

  10. Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoretical Computer Science 250(1-2), 333–363 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science 231(1), 17–32 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Nerode, A.: Linear automaton transformation. Proc. American Mathematical Society 9, 541–544 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  13. Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science 40, 67–84 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, the Netherlands (1995)

    Google Scholar 

  15. Watson, B.W.: An incremental DFA minimization algorithm. In: Proc. 3rd International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP 2001) (2001)

    Google Scholar 

  16. Watson, B.W., Daciuk, J.: An efficient incremental DFA minimization algorithm. Natural Language Engineering 9(1), 49–64 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT – UPS & CNRS, LSV – ENS de Cachan & CNRS – Cachan, France, Toulouse, France

    Manuel Baclet

  2. ONERA / Cert, Toulouse, France

    Claire Pagetti

Authors
  1. Manuel Baclet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claire Pagetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baclet, M., Pagetti, C. (2006). Around Hopcroft’s Algorithm. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_12

Download citation

  • DOI: https://doi.org/10.1007/11812128_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37213-4

  • Online ISBN: 978-3-540-37214-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation