Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski

Authors:
Bruce W. Watson
Affiliations:
-
Venue:
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Year:
2000

Citing 7
Cited 2

Minimisation of acyclic deterministic automata in linear time

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Theory of Computation: A Primer

Theory of Computation: A Primer
A Discipline of Programming

A Discipline of Programming
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Incremental construction of minimal acyclic finite-state automata

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

Brzozowski's algorithm (co)algebraically

Logic and Program Semantics
Algebra-coalgebra duality in brzozowski's minimization algorithm

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we combine (and refine) two of Brzozowski's algorithms -- yielding a single algorithm which constructs a minimal deterministic finite automaton (DFA) from a regular expression.