Automaton implementations for finite state transducers.
This module defines a trait,
Automaton, with several implementations
including, but not limited to, union, intersection and complement.
An automaton that always matches.
An automaton that matches exactly when the automaton it wraps does not.
An automaton that matches when both of its component automata match.
A Unicode aware Levenshtein automaton for running efficient fuzzy queries.
An automaton that matches a string that begins with something that the wrapped automaton matches.
An automaton that matches if the input equals to a specific string.
An automaton that matches if the input contains a specific subsequence.
An automaton that matches when one of its component automata match.
An error that occurred while building a Levenshtein automaton.
Automaton describes types that behave as a finite automaton.