automata_core 0.1.3

Deterministic and nondeterministic finite-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 with finite state sets and finite input alphabets.
//!
//! This module defines:
//! - [`FiniteAutomaton`](automaton::FiniteAutomaton),
//! - [`DeterministicFiniteAutomaton`](deterministic::DeterministicFiniteAutomaton),
//! - [`NonDeterministicFiniteAutomaton`](nondeterministic::NonDeterministicFiniteAutomaton),
//! - Graphviz (`.dot`) support via [`FiniteAutomaton::to_dot`](automaton::FiniteAutomaton::to_dot)
//! - DFA transition matrices via `SimpleDFA::to_matrix` (and similar helpers).
//! - Lexer-style longest-match parsing via [`parsing::parse_by_longest_match`](parsing::parse_by_longest_match).

mod automaton;
mod deterministic;
mod nondeterministic;

pub mod parsing;

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