Skip to main content
Conference Proceedings

Directly constructing minimal DFAs: Combining two algorithms by brzozowski

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2088 311-317
DOI: 10.1007/3-540-44674-5_27
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Watson, B. W. (2001). Directly constructing minimal DFAs: Combining two algorithms by brzozowski. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2088, pp. 311–317). Springer Verlag. https://doi.org/10.1007/3-540-44674-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free