This artifact provides efficient implementations for various collection data structures (esp. linked lists and priority queues), which have very insufficient implementation in the Java Collections Framework that makes it hard or even impossible to exploit their efficiencies.

This artifact contains the API of AutomataLib, which mainly consists of interfaces for the various concepts and automaton models supported by the AutomataLib core. In addition to that, it also defines some fundamental classes for ...

The core artifact of AutomataLib. This library contains concrete implementations for many of the automaton model interfaces defined in the API artifact, as well as abstract base classes that facilitate implementing new automaton model ...

Basic utility library containing several useful classes to ease everyday programming.

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

A collection of algorithms for handling counterexamples in automata learning

Data- and utility classes for Discrimination Trees

Module for data structures shared by multiple learning algorithms of LearnLib

An abstract counterexample analysis framework

This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

Support for posing membership queries in parallel