Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 17-23 |
Tijdschrift | South African Computer Journal |
Volume | 29 |
Status | Gepubliceerd - 2002 |