Struct automata::dfa::Dfa

pub struct Dfa<A: Alphabet> { /* private fields */ }

Implementations

impl<A: Alphabet> Dfa<A>

pub fn from_edges<I, V>(edge_iter: I, finals: V) -> Dfa<A>where
    I: IntoIterator<Item = (usize, A, usize)>,
    V: IntoIterator<Item = usize>,
    A: Clone + Debug,

Build a dfa from the connecting edges and final states.

States are numbered in an arbitrary order, except the start label 0. The automaton will deduce the used alphabet subset automatically and test whether it has been used consistently.

pub fn contains<I: IntoIterator<Item = A>>(&self, sequence: I) -> bool

Checks if the input word is contained in the language.

pub fn to_regex(self) -> Regex<A>

pub fn write_to(&self, output: &mut dyn Write) -> Result<()>where
    for<'a> &'a A: Display,

pub fn alphabet(&self) -> &[A]

The alphabet is the set of symbols in words of that language.

pub fn minimized(&self) -> Self

Minimize the automata into its language partition.

Contrary to NFAs, the resulting automaton is guaranteed to be a minimal automaton exactly equivalent to the languages minimal DFA.

pub fn pair(
    &self,
    rhs: &Self,
    decider: &dyn Fn(bool, bool) -> bool
) -> Option<Self>

Pairs two automata with a given binary boolean operation

If there are no final states, returns None.

pub fn pair_empty(
    &self,
    _rhs: &Self,
    _decider: &dyn Fn(bool, bool) -> bool
) -> bool

Like pair but only determines if the result would be an empty automaton.

This speeds up operations such as equivalence checks.