|NFA to DFA, minimize DFA firstname.lastname@example.org (1991-10-04)|
|Re: NFA to DFA, minimize DFA email@example.com (1991-10-07)|
|Re: NFA to DFA, minimize DFA firstname.lastname@example.org (1991-10-09)|
|From:||email@example.com (roberto bagnara)|
|Organization:||CERN, Geneva, Switzerland|
|Date:||4 Oct 91 09:41:18 GMT|
Has anybody got a good (e.g. *fast*) algorithm/implementation for the
problem of converting an NFA (nondeterministic finite automaton) to a DFA
(deterministic finite automaton)? And for the problem of minimizing the
number of states of a DFA?
I read the Red Dragon Book, and found enough information for (naively?)
implementing the two algorithms. My implementation is correct (tested and
in use) but slow and memory expensive (given the particular application I
need it for).
Thanks a lot
P.S. Please respond by EMail, I'll summarize on request.
Return to the
Search the comp.compilers archives again.