Brzozowski's minimization algorithm: more robust than expected

Authors:
Markus Holzer;Sebastian Jakobi
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 9
Cited 0

Minimal NFA problems are hard

SIAM Journal on Computing
Minimal cover-automata for finite languages

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

Introduction To Automata Theory, Languages, And Computation
Hyper-minimisation Made Efficient

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Theoretical Computer Science
On minimising automata with errors

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Nondeterministic Moore automata and Brzozowski's minimization algorithm

Theoretical Computer Science
Brzozowski's algorithm (co)algebraically

Logic and Program Semantics
From equivalence to almost-equivalence, and beyond--minimizing automata with errors

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a finite automaton, regardless whether it is deterministic or nondeterministic, Brzozowski's minimization algorithm computes the equivalent minimal deterministic finite automaton by applying reversal and power-set construction twice. Although this is an exponential algorithm because of the power-set construction, it performs well in experimental studies compared to efficient O(nlogn) minimization algorithms. Here we show how to slightly enhance Brzozowski's minimization algorithm by some sort of reachability information so that it can be applied to the following automata models: deterministic cover automata, almost equivalent deterministic finite state machines, and k-similar automata.