Deterministic Finite-State Automata Library for Rust, written in L1.
-
try_parse(regex)- space complexity =
$O(2^x)$ - time complexity =
$O(2^x)$ - worst case example:
/(01|10)*[01]{x}/
- space complexity =
-
x.accepts(s)- time complexity =
$s$
- time complexity =
-
x.is_empty()- time complexity =
$x$
- time complexity =
-
x.complement()- space complexity =
$x$ - time complexity =
$x$
- space complexity =
-
x.intersect(y)- space complexity =
$xy$ - time complexity =
$xy$
- space complexity =
-
x.union(y)- space complexity =
$xy$ - time complexity =
$xy$
- space complexity =
-
x.minimize()- time complexity =
$x\log x\Sigma_x$
- time complexity =
-
x.is_subset_of(y)- space complexity =
$xy$ - time complexity =
$xy$
- space complexity =
-
x.reverse()-
space complexity =
$O(2^x)$ - time complexity =
$O(2^x)$ - worst case example:
/[01]{x}(01|10)*/
-
space complexity =