Artifacts using automata-util version 0.5.2

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 simple, straightforward implementation of Dana Angluin's L* algorithm

A collection of examples of how to use LearnLib

This artifact contains several miscellaneous, well-known algorithms, which however are rather specific in their concrete use case and therefore not fit for the AutomataLib Utilities library. Examples include Dijkstra's algorithm for the SSSP problem, the Floyd-Warshall algorithm for the APSP problem and Tarjan's algorithm for finding all strongly-connected components in a graph.

The complete archetype, which provides preconfigured dependencies on all artifacts of AutomataLib.

AutomataLib :: Archetypes :: Typical