Artifacts using LearnLib :: Datastructures :: Discrimination Tree (9)

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.

A learning algorithm, which distinguishes hypothesis states using a discrimination tree (visibly push-down automata variant).

This artifact provides the implementation of the VPA adaption of the Observation-Pack learning algorithm as discussed in the PhD thesis "Foundations of Active Automata Learning: An Algorithmic Perspective" (https://dx.doi.org/10.17877/DE290R-16359) by Malte Isberner.

An artifact that aggregates all other artifacts of LearnLib to produce an Uber-JAR that can be used in non-maven environments. Likewise, this single artifact may be used in maven-aware environments to declare a dependency on all LearnLib artifacts.

This artifact provides the implementation of the VPA adaption of the TTT learning algorithm as presented in the PhD thesis "Foundations of Active Automata Learning: An Algorithmic Perspective" (https://dx.doi.org/10.17877/DE290R-16359) by Malte Isberner.

The TTT Algorithm (visibly push-down automata variant)