Skip to main content
SpringerLink
Log in

A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs

  • Conference paper
  • First Online:
Book cover Automata Implementation (WIA 1998)

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

Included in the following conference series:

Abstract

We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful for storing sets of words for spell-checking, among other applications. The algorithm is semi-incremental because it maintains the automaton in near-minimal condition and requires a final minimization step after the last word has been added (during construction).

The algorithm derivation proceeds formally (with correctness arguments) from two separate algorithms, one for minimization and one for adding words to acyclic automata. The algorithms are derived in such a way as to be combinable, yielding a semi-incremental one. In practice, the algorithm is both easy to implement and displays good running time performance.

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

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

    MATH  Google Scholar 

  3. Revuz, D. Dictionnaires et lexiques: méthodes et algorithmes. (Ph.D dissertation, Institut Blaise Pascal, LITP 91.44, Paris, France, 1991).

    Google Scholar 

  4. Watson, B.W. Taxonomies and Toolkits of Regular Language Algorithms. (Ph.D dissertation, Eindhoven University of Technology, The Netherlands, 1995). See http://www.RibbitSoft.com/research/watson

    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

  2. Ribbit Software Systems Inc (IST Technologies Research Group), Box 24040, 297 Bernard Ave., Kelowna, B.C., V1Y 9P9, Canada

    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. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Watson, B.W. (1999). A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation