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 language | English |
---|---|
Pages (from-to) | 17-23 |
Journal | South African Computer Journal |
Volume | 29 |
Publication status | Published - 2002 |