All Classes Interface Summary Class Summary Enum Summary
| Class |
Description |
| DefaultLearningExample<I,D,A extends UniversalAutomaton<?,I,?,?,?> & SuffixOutput<I,D>> |
A learning example that directly stores the alphabet and the reference automaton in its
fields. |
| DefaultLearningExample.DefaultDFALearningExample<I> |
|
| DefaultLearningExample.DefaultMealyLearningExample<I,D> |
|
| DefaultLearningExample.DefaultMooreLearningExample<I,D> |
|
| DefaultLearningExample.DefaultOneSEVPALearningExample<I> |
|
| DefaultLearningExample.DefaultSBALearningExample<I> |
|
| DefaultLearningExample.DefaultSPALearningExample<I> |
|
| DefaultLearningExample.DefaultSPMMLearningExample<I,O> |
|
| DefaultLearningExample.DefaultSSTLearningExample<I,D> |
|
| DefaultPassiveLearningExample<I,D> |
Default implementation for a passive learning example.
|
| DefaultPassiveLearningExample.DefaultDFAPassiveLearningExample<I> |
|
| DefaultPassiveLearningExample.DefaultMealyPassiveLearningExample<I,O> |
|
| DefaultPassiveLearningExample.DefaultMoorePassiveLearningExample<I,O> |
|
| DefaultPassiveLearningExample.DefaultSSTPassiveLearningExample<I,O> |
|
| DFABenchmarks |
|
| ExampleAngluin |
This class provides the example used in the paper ''Learning Regular Sets from Queries and Counterexamples'' by Dana
Angluin that consists of an automaton that accepts ''all strings over {0,1} with an even number of 0's and an even
number of 1's''.
|
| ExampleCoffeeMachine |
This example represents the Coffee Machine example from Steffen et al.
|
| ExampleCoffeeMachine.Input |
|
| ExampleGrid |
This class generates a Mealy machine consisting of a two-dimensional grid of states.
|
| ExampleKeylock |
|
| ExamplePalindrome |
|
| ExamplePalindrome |
|
| ExamplePalindrome |
|
| ExamplePaulAndMary |
This class implements a sad love story - DFA style.
|
| ExampleRandomDFA |
|
| ExampleRandomMealy<I,O> |
|
| ExampleRandomMoore<I,O> |
|
| ExampleRandomOneSEVPA<I> |
|
| ExampleRandomSBA<I> |
|
| ExampleRandomSPA<I> |
|
| ExampleRandomSPMM<I,O> |
|
| ExampleRandomSST<I,O> |
|
| ExampleRandomStateLocalInputMealy<I,O> |
|
| ExampleShahbazGroz |
This class provides the example used in the paper ''Inferring Mealy Machines'' by Muzammil Shahbaz and Roland Groz
(see Figure 1).
|
| ExampleStack |
This example encodes a small stack with a capacity of three elements and "push" and "pop" operations as Mealy
machine.
|
| ExampleStack.Input |
|
| ExampleStack.Output |
|
| ExampleTinyDFA |
Tiny DFA with language (ab)*.
|
| ExampleTinyMealy |
Tiny machine with the language (a1a2)^*.
|
| LearningExample<I,A> |
|
| LearningExample.DFALearningExample<I> |
|
| LearningExample.MealyLearningExample<I,O> |
|
| LearningExample.MooreLearningExample<I,O> |
|
| LearningExample.OneSEVPALearningExample<I> |
|
| LearningExample.SBALearningExample<I> |
|
| LearningExample.SPALearningExample<I> |
|
| LearningExample.SPMMLearningExample<I,O> |
|
| LearningExample.SSTLearningExample<I,O> |
|
| LearningExample.StateLocalInputMealyLearningExample<I,O> |
|
| LearningExample.UniversalDeterministicLearningExample<I,A extends UniversalAutomaton<?,I,?,?,?>> |
|
| LearningExamples |
|
| PassiveLearningExample<I,D> |
|
| PassiveLearningExample.DFAPassiveLearningExample<I> |
|
| PassiveLearningExample.MealyPassiveLearningExample<I,O> |
|
| PassiveLearningExample.MoorePassiveLearningExample<I,O> |
|
| PassiveLearningExample.SSTPassiveLearningExample<I,O> |
|