Next: Executing a DFA Up: No Title Previous: DFA Construction

DFA Construction (2)

Algorithm:
$\begin{program} states[0]~=~$\emptyset$;~states[1]~=~closure(\{s\}); \\ j~=~0;~p... ...~1; \\ ~~~~~~~~~~~~~~~~\} \\ ~~~~~~~~\} \\ ~~~~~~~~j~=~j~+~1; \\ \}\end{program}$

Christoph Zenger
3/23/2000