The tool includes:

• learning algorithms for deterministic and non-deterministic nominal automata;
• a variant of the deterministic algorithm where counterexamples are added as columns.

The tool has been implemented in NLambda. NLambda is a recently developed Haskell library designed to allow direct manipulation of infinite structures in finite time.

The tool includes:

• a learning algorithm template for automata with side-effects given by a monad;
• efficient instantiations for non-deterministic and weighted automata;
• experiment code used in the paper.