Artifacts using LearnLib :: Commons :: Util (17)

Support classes for easily writing integration test cases for learning algorithms

A collection of membership oracles

A collection of equivalence oracles

Caches to avoid posing duplicate membership queries

Support classes for easily writing unit tests for various components of LearnLib

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://dx.doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" ...

This artifact provides the implementation of the learning algorithm described in the book "An Introduction to Computational Learning Theory" by Michael Kearns and Umesh Vazirani.

This artifact provides the implementation of the TTT algorithm as described in the paper "The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning" (https://doi.org/10.1007/978-3-319-11164-3_26) by Malte Isberner, Falk Howar, and Bernhard Steffen.

A learning algorithm, which distinguishes hypothesis states using a discrimination tree.

This artifact provides the implementation of the Observation-Pack learning algorithm as described in the PhD thesis "Active learning of interface programs" (http://dx.doi.org/10.17877/DE290R-4817) by Falk Howar.