Returns whether the languages of this and the other FA are disjoint.
The runtime of this algorithm is O(n * m) (n = number of states of this NFA, m = number of states of the other
FA) but it's a lot faster in practice with the worst case being very rare.
Since this uses the intersection operation, you can supply intersection options.
This is equivalent to NFA.fromIntersection(left, right).isEmpty but implemented more efficiently.
Returns whether the languages of this and the other FA are disjoint.
The runtime of this algorithm is
O(n * m)(n = number of states of this NFA, m = number of states of the other FA) but it's a lot faster in practice with the worst case being very rare.Since this uses the intersection operation, you can supply intersection options.
This is equivalent to
NFA.fromIntersection(left, right).isEmptybut implemented more efficiently.