Directly constructing minimal DFAs : combining two algorithms by Brzozowski

B.W. Watson

Research output: Contribution to journalArticleAcademicpeer-review

339 Downloads (Pure)

Abstract

In this paper, we combine (and refine) two of Brzozowski's algorithms - yielding a single algorithm which constructs aminimal deterministic finite automaton (DFA) from a regular expression.
Original languageEnglish
Pages (from-to)17-23
JournalSouth African Computer Journal
Volume29
Publication statusPublished - 2002

Fingerprint

Dive into the research topics of 'Directly constructing minimal DFAs : combining two algorithms by Brzozowski'. Together they form a unique fingerprint.

Cite this