L1 DFA

Deterministic Finite-State Automata Library for Rust, written in L1.

Features

• regex.try_parse()
• x.accepts(s)
  • time complexity = $s$
• x.complement()
  • space complexity = $c(x)$
  • time complexity = $c(x)$
• x.intersect(y)
  • space complexity = $c(x)c(y)$
  • time complexity = $c(x)c(y)$
• x.minimize()
  • time complexity = $c(x)\log c(x)\Sigma_x$
• x.is_subset_of(y)
• x.reverse()