Next:
Algorithm (2)
Up:
No Title
Previous:
From an NFA to
Algorithm
First step: For a set of states S, let closure(S) be the largest set of states, that is reachable from S using only
-transitions.
Algorithm to compute T = closure(S):
This is an example of a fixpoint algorithm.
Christoph Zenger
3/23/2000