Expand description
Computation of the intersection of two NFAs. The intersection of two NFAs is an NFA that accepts the intersection of the languages accepted by the two NFAs. The intersection is computed by constructing a product automaton. The product automaton has a state for each pair of states from the two input automata. The transitions are constructed by taking the cartesian product of the transitions of the two input automata.
Functionsยง
- intersect
- Computes the intersection of two NFAs. The intersection of two NFAs is an NFA that accepts the intersection of the languages accepted by the two NFAs. The intersection is computed by constructing a product automaton, which has at most |N| * |M| states, where N and M are the number of states of the input automata.