automata_core 0.2.0

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

//! Finite automata in the **unlabeled** API (`Label = ()`).
//!
//! Defines [`FiniteAutomaton`], [`DeterministicFiniteAutomaton`],
//! [`NonDeterministicFiniteAutomaton`], re-exports labeled parsing helpers from
//! [`crate::labeled::finite::parsing`], and hosts algorithms that need to
//! iterate over all states or alphabet symbols (NFA closure ops, `to_dfa`,
//! `complete`, `minimize`, `SimpleDFA::to_matrix`, etc.).
//!
//! For the same operations with arbitrary labels, see [`crate::labeled::finite`].

mod automaton;
mod deterministic;
mod nondeterministic;

pub mod parsing;

pub use automaton::FiniteAutomaton;
pub use deterministic::DeterministicFiniteAutomaton;
pub use nondeterministic::NonDeterministicFiniteAutomaton;