Weak Minimization of DFA — An Algorithm and Applications
DFA minimization is a central problem in algorithm design and is based on the notion of DFA equivalence: Two DFA’s are equivalent if and only if they accept the same set of strings. In this paper, we propose a new notion of DFA equivalence (that we call weak-equivalence):We say that two DFA’s are weakly equivalent if they both accept the same number of strings of length k for every k. The motivation for this problem is as follows. A large number of counting problems can be solved by encoding the combinatorial objects we want to count as strings over a finite alphabet. If the collection of encoded strings is accepted by a DFA, then standard algorithms from computational linear algebra can be used to solve the counting problem efficiently. When applying this approach to largwe-scale applications, the bottleneck is the space complexity since the computation involves a matrix of order k × k if k is the size of the underlying DFA M. This leads to the natural question: Is there a smaller DFA that is weakly equivalent to M? We present an algorithm of time complexity O(k 2) to find a compact DFA equivalent to a given DFA. We illustrate, in the case of tiling problem, that our algorithm reduces a (strongly minimal) DFA by a factor close to 2.
KeywordsTransfer Matrix Simple Path Input Symbol Grid Graph Counting Problem
Unable to display preview. Download preview PDF.
- [Gar]M. Garey and D. Johnson, Computers and Intractability-A Guide to the Theory of NP-completeness, W.H. Freeman & Sons (1979).Google Scholar
- [Hop]J. Hopcroft and J. Ullman, Introduction to Automata, Languages and Theory of Computation, Addison-Wesley, Inc. (1979).Google Scholar
- [Pac]L. Pachter, Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes, Electronic Journal of Combinatorics 4 (1997), #R29.Google Scholar
- [Pon]A. Ponitz and P. Tittmann, Improved Upper Bounds for Self-Avoiding Walks in Zd, Electronic Journal of Combinatorics 7 (2000), # R 21.Google Scholar
- [Pro]J. Propp, A reciprocity theorem for domino tilings, Electronic Journal of Combinatorics 8 (2001), # R 18.Google Scholar
- [Wil]H. Wilf, The problem of kings, Electronic Journal of Combinatorics. 2 (1995), #R3.Google Scholar