Next:
Simulating a DFA
Up:
No Title
Previous:
Algorithm
Algorithm (2)
Second step: For a set of states S and an input symbol c, let DFAedge(S,c) be the set of states that can be reached from S by following an edge labelled with c.
Algorithm to compute T=DFAedge(S,c)
Christoph Zenger
3/23/2000