An efficient incremental DFA minimization algorithm

Authors:
Bruce W. Watson;Jan Daciuk
Affiliations:
Dept. of Comp. Sci., Univ. of Pretoria, SA and Soft. Const. Res. Grp., Tech. Univ. of Eindhoven, The Netherlands and Ribbit Software Systems Inc. & FST Labs e-mail: watson@fst-labs.com;Alfa-Informatica, Rijksuniversiteit Groningen, Groningen, The Netherlands and Technical University of Gdansk, Poland e-mail: jandac@eti.pg.gda.pl
Venue:
Natural Language Engineering
Year:
2003

Citing 4
Cited 9

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Practical experiments with regular approximation of context-free languages

Computational Linguistics - Special issue on finite-state methods in NLP
Treatment of epsilon moves in subset construction

Computational Linguistics - Special issue on finite-state methods in NLP

NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science - Developments in language theory
Incremental construction of minimal deterministic finite cover automata

Theoretical Computer Science - Implementation and application of automata
On the equivalence of weighted finite-state transducers

ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Incremental DFA minimisation

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Around hopcroft’s algorithm

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An incremental algorithm for constructing minimal deterministic finite cover automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Optimized inlining of runtime monitors

NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Minimization of symbolic automata

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
From diagnosis of active systems to incremental determinization of finite acyclic automata

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new Deterministic Finite Automata (DFA) minimization algorithm. The algorithm is incremental – it may be halted at any time, yielding a partially-minimized automaton. All of the other (known) minimization algorithms have intermediate results which are not useable for partial minimization. Since the first algorithm is easily understood but inefficient, we consider three practical and effective optimizations. The first two optimizations do not affect the asymptotic worst-case running time – though they perform well on a large class of automata. The third optimization yields an quadratic-time algorithm which is competitive with the previously known ones.