All Downloads are FREE. Search and download functionalities are using the official Maven repository.

META-INF.MANIFEST.MF Maven / Gradle / Ivy

Go to download

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" (http://dx.doi.org/10.1006/inco.1993.1021) by Ronald L. Rivest and Robert E. Schapire.

There is a newer version: 0.18.0
Show newest version
Manifest-Version: 1.0
Built-By: frohme
Created-By: Apache Maven 3.5.2
Build-Jdk: 1.8.0_172





© 2015 - 2025 Weber Informatics LLC | Privacy Policy