Membership and equivalence oracles using an automaton model as backend

Support classes for easily writing integration test cases for learning algorithms

Caches to avoid posing duplicate membership queries

This artifact provides the implementation of the DHC learning algorithm as described in the paper "Automata Learning with on-the-Fly Direct Hypothesis Construction" (https://doi.org/10.1007/978-3-642-34781-8_19) by Maik Merten, Falk ...

Basic support for test driver creation

This artifact provides the implementation of the NL* learning algorithm as described in the paper "Angluin-Style Learning of NFA" (http://ijcai.org/Proceedings/09/Papers/170.pdf) by Benedikt Bollig, Peter Habermehl, Carsten Kern, and ...

Archetype which includes all LearnLib dependencies

A flexible, optimized version of Dana Angluin's L* algorithm

A learning algorithm, which distinguishes hypothesis states using a discrimination tree.

A simple, straightforward implementation of Dana Angluin's L* algorithm

Archetype for a typical LearnLib setup, including the most commonly used dependencies