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

//! Labeled automaton traits: **no** assumption that state sets or alphabets are
//! finite (iterators may not terminate).
//!
//! - [`LabeledAutomaton`]: states, alphabet, initial states, optional labels.
//! - [`DeterministicLabeledAutomaton`]: unique initial state and transition function.
//! - [`NonDeterministicLabeledAutomaton`]: multiple initials and successor sets.

mod automaton;
mod deterministic;
mod nondeterministic;

pub use automaton::LabeledAutomaton;
pub use deterministic::DeterministicLabeledAutomaton;
pub use nondeterministic::NonDeterministicLabeledAutomaton;