Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
determinization_of_finite_state_machine [2007/05/05 17:18] vkuncak |
determinization_of_finite_state_machine [2007/05/05 17:21] (current) vkuncak |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| * $\Delta_D = \{ (S,a,\Delta_{run}(S,a)) \mid S \subseteq Q, a \in \Sigma \}$ | * $\Delta_D = \{ (S,a,\Delta_{run}(S,a)) \mid S \subseteq Q, a \in \Sigma \}$ | ||
| * $F_D = \{ S \mid S \cap F \neq \emptyset \}$. | * $F_D = \{ S \mid S \cap F \neq \emptyset \}$. | ||
| + | |||
| + | The corresponding deterministic state machine maintains a set of states instead of just one state, and simultaneously transitions into all states that the original machine could reach from the current set of states. | ||