automata_core 0.2.1

Deterministic and nondeterministic automata algorithms in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

use std::hash::Hash;

use crate::labeled::arbitrary::automaton::LabeledAutomaton;

/// Nondeterministic labeled automaton: a set of successors per step.
pub trait NonDeterministicLabeledAutomaton<Label: Hash + Eq + Clone>:
    LabeledAutomaton<Label>
{
    /// Iterator over initial states.
    fn initial_states<'a>(&'a self) -> impl Iterator<Item = Self::State> + 'a
    where
        Self::State: 'a;

    /// Successors of `state` under `input`.
    fn successors<'a>(
        &'a self,
        state: Self::State,
        input: &Self::Input,
    ) -> impl Iterator<Item = Self::State> + 'a
    where
        Self::State: 'a;
}