Artifacts using automata-util version 0.7.0

Example learning setups to be used for integration testing

Support classes for easily writing integration test cases for learning algorithms

(De-)Serializers for the DOT Format

A collection of utility methods for learning setups (oracle wrappers, etc.)

A collection of equivalence oracles

Data- and utility classes for Discrimination Trees

This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

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

Data- and utility classes for Prefix-Tree-Acceptors

An artifact that aggregates all other artifacts of AutomataLib 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 AutomataLib artifacts.