Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Minimization of DFAs with Partial Transition Functions

Published 20 Feb 2008 in cs.IT, cs.DS, and math.IT | (0802.2826v1)

Abstract: Let PT-DFA mean a deterministic finite automaton whose transition relation is a partial function. We present an algorithm for minimizing a PT-DFA in O(mlg⁡n)O(m \lg n) time and O(m+n+α)O(m+n+\alpha) memory, where nn is the number of states, mm is the number of defined transitions, and α\alpha is the size of the alphabet. Time consumption does not depend on α\alpha, because the α\alpha term arises from an array that is accessed at random and never initialized. It is not needed, if transitions are in a suitable order in the input. The algorithm uses two instances of an array-based data structure for maintaining a refinable partition. Its operations are all amortized constant time. One instance represents the classical blocks and the other a partition of transitions. Our measurements demonstrate the speed advantage of our algorithm on PT-DFAs over an O(αnlg⁡n)O(\alpha n \lg n) time, O(αn)O(\alpha n) memory algorithm.

Citations (41)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.