An incremental algorithm for constructing minimal deterministic finite cover automata

Authors:
Cezar Câmpeanu;Andrei Păun;Jason R. Smith
Affiliations:
Department of Computer Science and Information Technology, University of Prince Edward Island, Charlottetown, Canada;Department of Computer Science/Institute for Micromanufacturing, College of Engineering and Science, Louisiana Tech University, Ruston, Louisiana;Department of Computer Science/Institute for Micromanufacturing, College of Engineering and Science, Louisiana Tech University, Ruston, Louisiana
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 11
Cited 0

Formal languages

Formal languages
Regular languages

Handbook of formal languages, vol. 1
Minimal cover-automata for finite languages

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Incremental construction and maintenance of minimal finite-state automata

Computational Linguistics
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Optimal insertion in deterministic DAWGs

Theoretical Computer Science
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
An efficient incremental DFA minimization algorithm

Natural Language Engineering
Results on Transforming NFA into DFCA

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best known DFCA minimization technique.