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

//! Unlabeled automata traits (`Label = ()`): same trait shapes as
//! [`crate::labeled::arbitrary`]. State sets and alphabets are **not** assumed
//! finite.
//!
//! A state is **accepting** iff [`LabeledAutomaton::get_label`](crate::labeled::arbitrary::LabeledAutomaton::get_label)
//! returns `Some(())`. Use [`crate::labeled`] when you need structured output
//! on final states (tokens, priorities, etc.).

mod automaton;
mod deterministic;
mod nondeterministic;

pub use automaton::Automaton;
pub use deterministic::DeterministicAutomaton;
pub use nondeterministic::NonDeterministicAutomaton;