You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Right now, determinizing and minimizing our NFAs is a major performance bottleneck. However, our FAs are only N because of Rust unions. I believe we can cut out the NFA representation altogether. Given DFAs A and B, we can efficiently compute the union(A, B) without producing an intermediate NFA that must be determinized and minimized.