equal
deleted
inserted
replaced
95 For NFAs you need to first define what $\hat{\rho}$ means. If |
95 For NFAs you need to first define what $\hat{\rho}$ means. If |
96 $\rho$ is given as a relation, you can define: |
96 $\rho$ is given as a relation, you can define: |
97 |
97 |
98 \[ |
98 \[ |
99 \hat{\rho}(qs, []) \dn qs \qquad |
99 \hat{\rho}(qs, []) \dn qs \qquad |
100 \hat{\rho}(qs, c::s) \dn \bigcup_{q\in qs} \{ q' \; | \; \rho(q, c, q')\} |
100 \hat{\rho}(qs, c::s) \dn \bigcup_{q\in qs} \hat{\rho}(\{ q' \; | \; \rho(q, c, q')\}, s) |
101 \] |
101 \] |
102 |
102 |
103 This ``collects'' all the states reachable in a breadth-first |
103 This ``collects'' all the states reachable in a breadth-first |
104 manner. Once you have all the states reachable by an NFA, you can define |
104 manner. Once you have all the states reachable by an NFA, you can define |
105 the language as |
105 the language as |