CALF Logo

Categorical

Automata

Learning

Framework

modular design and development of automata learning algorithms, with correctness-by-construction guarantees

Nominal L*

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.