L1 DFA
Deterministic Finite-State Automata Library for Rust, written in L1.
Features
regex.try_parse()x.accepts(s)x.complement()x.intersect(y)x.minimize()x.is_subset_of(y)x.reverse()
Deterministic Finite-State Automata Library for Rust, written in L1.
regex.try_parse()x.accepts(s)x.complement()x.intersect(y)x.minimize()x.is_subset_of(y)x.reverse()