Functionality to ease writing test cases for LearnLib

Infrastructure and core interfaces of LearnLib

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

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

This artifact provides the implementation of the DHC learning algorithm as described in the paper "Automata

A collection of basic algorithm for approximating equivalence queries

Membership and equivalence oracles using an automaton model as backend

A collection of algorithms for handling counterexamples in automata learning

Caches to avoid posing duplicate membership queries

Support for posing membership queries in parallel

This package contains a full DFA/NFA implementation with Unicode

This artifact contains the API of AutomataLib, which mainly consists of interfaces

The core artifact of AutomataLib. This library contains concrete implementations for many

This artifact provides various common utility operations for analyzing and manipulating

This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed),

This artifact contains adapter classes for treating the Automaton objects from the

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

This artifact provides efficient implementations for various collection data structures

This utility artifact contains methods that facilitate interaction with the

TestNG is a testing framework inspired from JUnit and NUnit but introducing some new functionalities that make it more ...