Download JAR files tagged by automata with all dependencies

This artifact provides the implementations of various learning algorithms for systems of procedural automata such as the ones described in the papers "Compositional learning of mutually recursive procedural systems (https://doi.org/10.1007/s10009-021-00634-y) and "From Languages to Behaviors and Back" (https://doi.org/10.1007/978-3-031-15629-8_11) by Markus Frohme and Bernhard Steffen.

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.