article

Free access

Incremental construction of minimal acyclic finite-state automata

Authors:

Jan Daciuk,

Bruce W. Watson,

Stoyan Mihov,

Richard E. WatsonAuthors Info & Claims

Computational Linguistics, Volume 26, Issue 1

Pages 3 - 16

https://doi.org/10.1162/089120100561601

Published: 01 March 2000 Publication History

PDF eReader

Abstract

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to other methods.

References

[1]

Daciuk, Jan, Bruce W. Watson, and Richard E. Watson. 1998. Incremental construction of minimal acyclic finite state automata and transducers. In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pages 48--56, Ankara, Turkey, 30 June--1 July.]]

Google Scholar

[2]

Hopcroft, John E. and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.]]

Digital Library

Google Scholar

[3]

Mihov, Stoyan. 1998. Direct building of minimal automaton for given list. In Annuaire de l'Université de Sofia "St. KI. Ohridski", volume 91, book 1, pages 38--40. Faculté de Mathematique et Informatique, Sofia, Bulgaria, livre 1 edition, February. Available at http://lml.bas.bg/~stoyan/publications.html.]]

Google Scholar

[4]

Moll, Robert N., Michael A. Arbib, and A. J. Kfoury. 1988. Introduction to Formal Language Theory. Springer Verlag, New York, NY.]]

Digital Library

Google Scholar

[5]

Revuz, Dominique. 1991. Dictionnaires et lexiques: méthodes et algorithmes. Ph.D. thesis, Institut Blaise Pascal, Paris, France. LITP 91.44.]]

Google Scholar

[6]

Watson, Bruce W. 1993a. A taxonomy of finite automata construction algorithms. Computing Science Note 93/43, Eindhoven University of Technology, The Netherlands. Available at www.OpenFIRE.org.]]

Google Scholar

[7]

Watson, Bruce W. 1993b. A taxonomy of finite automata minimization algorithms. Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands. Available at www.OpenFIRE.org.]]

Google Scholar

[8]

Watson, Bruce W. 1995. Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. thesis, Eindhoven University of Technology, the Netherlands. Available at www.OpenFIRE.org.]]

Google Scholar

[9]

Watson, Bruce W. 1998. A fast new semi-incremental algorithm for construction of minimal acyclic DFAs. In Proceedings of the Third International Workshop on Implementing Automata, pages 121--32, Rouen, France, 17--19 September.]]

Digital Library

Google Scholar

Cited By

View all

Dell’Erba DLi YSchewe S(2024)DFAMiner: Mining Minimal Separating DFAs from Labelled SamplesFormal Methods10.1007/978-3-031-71177-0_4(48-66)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71177-0_4
Goulart Rocha Evan der Aalst W(2023)Polynomial-Time Conformance Checking for Process TreesBusiness Process Management10.1007/978-3-031-41620-0_7(109-125)Online publication date: 11-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-41620-0_7
Andrés JToselli AVidal E(2022)Approximate Search for Keywords in Handwritten Text ImagesDocument Analysis Systems10.1007/978-3-031-06555-2_25(367-381)Online publication date: 22-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-06555-2_25
Show More Cited By

Recommendations

Incremental construction and maintenance of minimal finite-state automata

Daciuk et al. [Computational Linguistics 26(1):3-16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finite-state automata (dictionaries) from sets of strings. But acyclic finite-state automata have limitations: ...
Incremental construction of minimal deterministic finite cover automata
Implementation and application of automata

We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal Deterministic Finite Automata (...
Minimal cover-automata for finite languages

A cover-automaton A of a finite language L Σ is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L ...

Comments

Information & Contributors

Information

Published In

Computational Linguistics Volume 26, Issue 1

Special issue on finite-state methods in NLP

March 2000

105 pages

ISSN:0891-2017

EISSN:1530-9312

Issue’s Table of Contents

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 March 2000

Published in COLI Volume 26, Issue 1

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
993
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)14

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dell’Erba DLi YSchewe S(2024)DFAMiner: Mining Minimal Separating DFAs from Labelled SamplesFormal Methods10.1007/978-3-031-71177-0_4(48-66)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71177-0_4
Goulart Rocha Evan der Aalst W(2023)Polynomial-Time Conformance Checking for Process TreesBusiness Process Management10.1007/978-3-031-41620-0_7(109-125)Online publication date: 11-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-41620-0_7
Andrés JToselli AVidal E(2022)Approximate Search for Keywords in Handwritten Text ImagesDocument Analysis Systems10.1007/978-3-031-06555-2_25(367-381)Online publication date: 22-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-06555-2_25
Tsimpiris AVarsamis DStrouthopoulos CPavlidis GChairi K(2021)Open-source OCR Engine Integration with Greek DictionaryProceedings of the 25th Pan-Hellenic Conference on Informatics10.1145/3503823.3503903(436-441)Online publication date: 26-Nov-2021
https://dl.acm.org/doi/10.1145/3503823.3503903
Borboudakis GTsamardinos I(2021)Extending greedy feature selection algorithms to multiple solutionsData Mining and Knowledge Discovery10.1007/s10618-020-00731-735:4(1393-1434)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s10618-020-00731-7
Martinez-Rodriguez JHogan ALopez-Arevalo I(2020)Information extraction meets the Semantic WebSemantic Web10.3233/SW-18033311:2(255-335)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.3233/SW-180333
Matsumoto SBosamiya JDai Yvan Oorschot PParno B(2020)CAPS: Smoothly Transitioning to a More Resilient Web PKIProceedings of the 36th Annual Computer Security Applications Conference10.1145/3427228.3427284(655-668)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3427228.3427284
Bryant R(2020)Chain Reduction for Binary and Zero-Suppressed Decision DiagramsJournal of Automated Reasoning10.1007/s10817-020-09569-664:7(1361-1391)Online publication date: 1-Oct-2020
https://dl.acm.org/doi/10.1007/s10817-020-09569-6
Ercan GElbassuoni SHose K(2019)Retrieving Textual Evidence for Knowledge Graph FactsThe Semantic Web10.1007/978-3-030-21348-0_4(52-67)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1007/978-3-030-21348-0_4
Denzumi S(2018)Sequence Sentential Decision DiagramsCombinatorial Optimization and Applications10.1007/978-3-030-04651-4_40(592-606)Online publication date: 15-Dec-2018
https://dl.acm.org/doi/10.1007/978-3-030-04651-4_40
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Incremental construction and maintenance of minimal finite-state automata

Incremental construction of minimal deterministic finite cover automata

Minimal cover-automata for finite languages

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations