Expand description
Automaton implementations for finite state transducers.
This module defines a trait, Automaton
, with several implementations
including, but not limited to, union, intersection and complement.
Structs
An automaton that always matches.
An automaton that matches exactly when the automaton it wraps does not.
The
Automaton
state for Complement<A>
.An automaton that matches when both of its component automata match.
The
Automaton
state for Intersection<A, B>
.An automaton that matches a string that begins with something that the
wrapped automaton matches.
The
Automaton
state for StartsWith<A>
.An automaton that matches if the input contains a specific subsequence.
An automaton that matches when one of its component automata match.
The
Automaton
state for Union<A, B>
.Traits
Automaton describes types that behave as a finite automaton.