Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

How to use sorting procedures to minimize DFA

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1996)

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

Included in the following conference series:

Abstract

In this paper we introduce a new idea, which can be used in minimization of a deterministic finite automaton. Namely, we associate names with states of an automaton and we sort them. We give a new algorithm, its correctness proof, and its proof of execution time bound. This algorithm has time complexity O(n 2 log n) and can be considered as a direct improvement of Wood's algorithm [6] which has time complexity O(n3), where n is the number of states. Wood's algorithm checks if pairs of states are distinguishable. It is improved by making better use of transitivity. Similarly some other algorithms which check if pairs of states are distinguishable can be improved using sorting procedures.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. A. Brzozowski, H. Jürgensen: A model for Sequential Machine Testing and Diagnosis, Journal of Electronic Testing: Theory and Applications 3 (1992), 219–234.

    Google Scholar 

  2. J. E. Hopcroft: An n log n algorithm for minimizing the states in a finite automaton, in: Z. Kohavi, ed., The Theory of Machines and Computations, Academic Press, New York, 1971, 189–196.

    Google Scholar 

  3. J. E. Hopcroft, J. D. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, New Jersey, March 1979.

    Google Scholar 

  4. B. Schubert: How to Use Sorting Procedures to Minimize DFA, MSc Thesis, Department of Computer Science, University of Western Ontario, in preparation.

    Google Scholar 

  5. B. W. Watson: Taxonomies and Toolkits of Regular Language Algorithms, Eindhoven University of Technology, The Netherlands, 1995.

    Google Scholar 

  6. D. Wood: Theory of Computation, John Wiley & Sons, New York, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Barbara Schubert

Authors
  1. Barbara Schubert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Darrell Raymond Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schubert, B. (1997). How to use sorting procedures to minimize DFA. In: Raymond, D., Wood, D., Yu, S. (eds) Automata Implementation. WIA 1996. Lecture Notes in Computer Science, vol 1260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63174-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-63174-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63174-3

  • Online ISBN: 978-3-540-69205-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation