Package | Description |
---|---|
de.learnlib.examples | |
de.learnlib.examples.dfa | |
de.learnlib.examples.mealy |
Modifier and Type | Class and Description |
---|---|
static class |
DefaultLearningExample.DefaultDFALearningExample<I> |
static class |
DefaultLearningExample.DefaultMealyLearningExample<I,D> |
Modifier and Type | Class and Description |
---|---|
class |
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.''
|
class |
ExampleKeylock |
class |
ExamplePaulAndMary
This class implements a sad love story - DFA style.
|
class |
ExampleRandomDFA |
Modifier and Type | Class and Description |
---|---|
class |
ExampleCoffeeMachine
This example represents the Coffee Machine example from
Steffen et al.
|
class |
ExampleGrid
This class generates a Mealy machine consisting of a two-dimensional grid of
states.
|
class |
ExampleRandomMealy<I,O> |
class |
ExampleShahbazGroz
This class provides the example used in the paper ''Inferring Mealy Machines''
by Muzammil Shahbaz and Roland Groz (see Figure 1).
|
class |
ExampleStack
This example encodes a small stack with a capacity of three elements
and "push" and "pop" operations as Mealy machine.
|
Copyright © 2015. All rights reserved.