Common interfaces providing features supported by various learning algorithms

A collection of basic algorithm for approximating equivalence queries

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, ...

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 ...

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.

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

This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update time" ...

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

This artifact provides the implementation of the DHC learning algorithm as described in the paper "Automata Learning with on-the-Fly Direct Hypothesis Construction" (https://doi.org/10.1007/978-3-642-34781-8_19) by Maik Merten, Falk ...