Expand description
State-merging regular inference for labelled symbol examples.
The implementation follows the classic PTA/APTA plus red-blue state-merging shape used by RPNI, EDSM, and ALERGIA. It is a clean-room Rust implementation derived from the public issue specification and the cited papers/permissive references named there; no GPL or LGPL implementation is linked, vendored, or consulted by this crate.
Structs§
- Apta
- Augmented prefix-tree acceptor built directly from a
Sample. - Apta
State - One state in an augmented prefix-tree acceptor.
- Inferred
Automaton - Inferred deterministic finite automaton.
- Inferred
State - Public state in an inferred partial DFA.
- Merge
Event - One accepted state merge performed by a learner.
- Sample
- Labelled examples over a token or character alphabet.
Enums§
- Merge
Strategy - State-merging strategy used by
infer_dfa.
Functions§
- infer_
dfa - Infers a regular automaton from labelled examples.
Type Aliases§
- Symbol
- A token or character symbol consumed by the regular learner.