Skip to main content
Springer Nature Link
Log in

Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski

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

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

Included in the following conference series:

Abstract

In this paper, we combine (and refine) two of Brzozowski’s algorithms — yielding a single algorithm which constructs a minimal deterministic finite automaton (DFA) from a regular expression.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Brzozowski, J.A. Canonical regular expressions and minimal state graphs for definite events, in: Mathematical Theory of Automata. (pp. 529–561, Vol. 12, MRI Symposia Series, Polytechnic Press, Polytechnic Institute of Brooklyn, NY, 1962).

    Google Scholar 

  2. Brzozowski, J.A. Derivatives of regular expressions. (J. ACM 11(4), pp. 481–494, 1964).

    Article  MATH  MathSciNet  Google Scholar 

  3. Daciuk, J.D., Watson, B.W. and R.E. Watson. An Incremental Algorithm for Constructing Acyclic Deterministic Transducers. (Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, 30 June-1 July 1998).

    Google Scholar 

  4. Daciuk, J.D., Mihov, S., Watson, B.W. and R.E. Watson. Incremental Construction of Minimal Acyclic Finite State Automata. (to appear in Computational Linguistics, 2000).

    Google Scholar 

  5. Dijkstra, E.W. A Discipline of Programming. (Prentice Hall, Englewood Cliffs, N.J., 1976).

    MATH  Google Scholar 

  6. Gries, D. Describing an Algorithm by Hopcroft. (Acta Informatica 2, pp. 97–109, 1973).

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  8. Mihov, S. Direct Building of Minimal Automaton for Given List. (Available from stoyan@lml.acad.bg).

    Google Scholar 

  9. Revuz, D. Minimisation of Acyclic Deterministic Automata in Linear Time. (Theoretical Computer Science 92, pp. 181–189, 1992).

    Article  MATH  MathSciNet  Google Scholar 

  10. Watson, B.W. Taxonomies and Toolkits of Regular Language Algorithms. (Ph.D dissertation, Eindhoven University of Technology, The Netherlands, 1995). See http://www.OpenFIRE.org

  11. Watson, B.W. A Fast New Semi-Incremental Algorithm for the Construction of Minimal Acyclic DFAs. (Proceedings of the Third Workshop on Implementing Automata, Rouen, France, September 1998).

    Google Scholar 

  12. Watson, B.W. A History of Brzozowski’s DFA minimization algorithm. (Poster at the International Conference on Implementing Automata, London, Ontario, 2000).

    Google Scholar 

  13. Watson, B.W. A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata. (to appear, 2000).

    Google Scholar 

  14. Wood, D. Theory of Computation. (Harper & Row, New York, N.Y., 1987).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. (Department of Computer Science), University of Pretoria, Pretoria, 0002, South Africa

    Bruce W. Watson

Authors
  1. Bruce W. Watson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Watson, B.W. (2001). Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation