Group: LearnLib

Sort by:Popular▼

✓Popular✓Newest

Group LearnLib Testsupport

Infrastructure and core interfaces of LearnLib

Group LearnLib Tooling

A collection of membership oracles

Infrastructure and core functionalities of LearnLib

A collection of utility methods for learning setups (oracle wrappers, etc.)

A collection of algorithms for handling counterexamples in automata learning

A collection of equivalence oracles

Utilities for simulating SULs

Membership and equivalence oracles using an automaton model as backend

Caches to avoid posing duplicate membership queries

Module for data structures shared by multiple learning algorithms of LearnLib

Data- and utility classes for Discrimination Trees

A collection of basic algorithm for approximating equivalence queries

Functionality to ease writing test cases for LearnLib

An abstract counterexample analysis framework

Data- and utility classes for Lists

Filters for collecting statistical data

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

This artifact provides the implementation of the L* learning algorithm described in the paper "Learning Regular Sets from Queries and Counterexamples" (https://doi.org/10.1016/0890-5401(87)90052-6) by Dana Angluin including variations and optimizations thereof such as the versions based on "On the Learnability of Infinitary Regular Sets" (https://doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" ...