Expand description
Rust implementation of the L* active automata learning algorithm.
This crate provides:
- Core automata data structures (
Automata,State,Transition) - Knowledge base abstractions for answering membership queries
- Multiple equivalence-test strategies
- An
LSTARlearner that infers Mealy-style automata from observations
Re-exports§
pub use automata::Automata;pub use automata::State;pub use automata::Transition;pub use automata::build_dot_code;pub use automata::parse_dot;pub use eqtest::BDistMethod;pub use eqtest::EquivalenceTest;pub use eqtest::MultipleEqtests;pub use eqtest::RandomWalkMethod;pub use eqtest::WMethodEQ;pub use eqtest::WpMethodEQ;pub use knowledge_base::KnowledgeBase;pub use knowledge_base::KnowledgeNode;pub use knowledge_base::KnowledgeTree;pub use letter::EmptyLetter;pub use letter::Letter;pub use lstar::LSTAR;pub use observation_table::ObservationTable;pub use query::OutputQuery;pub use word::Word;
Modules§
- automata
- Automata model and DOT import/export helpers. Automata primitives and DOT serialization/parsing utilities.
- eqtest
- Equivalence-test strategies used by the learner. Equivalence-test strategy interfaces and implementations.
- knowledge_
base - Knowledge-base traits and implementations for query resolution. Knowledge-base traits and implementations.
- letter
- Letter/symbol representation.
- lstar
- Main L* learner implementation.
- observation_
table - Observation-table implementation used by L*.
- query
- Query data model.
- word
- Word abstraction built from letters.