//! Finite labeled automata: enumerable states and alphabet.
//!
//! Comprises [`FiniteLabeledAutomaton`], [`DeterministicFiniteLabeledAutomaton`],
//! [`NonDeterministicFiniteLabeledAutomaton`], and [`parsing`] for DFA
//! longest-match lexing.
pub use FiniteLabeledAutomaton;
pub use DeterministicFiniteLabeledAutomaton;
pub use NonDeterministicFiniteLabeledAutomaton;