All Classes

Class	Description
AbstractAAARLearner<L extends LearningAlgorithm<CM,CI,D> & SupportsGrowingAlphabet<CI>,AM,CM,AI,CI,D>	Base implementation of the learner presented in "Automata Learning with Automated Alphabet Abstraction Refinement" by Howar et al.
AbstractAbstractionTree<AI,CI,D>
AbstractAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP> & SupportsGrowingAlphabet<I>>	Abstract base class for algorithms that produce (subclasses of) MutableDeterministic automata.
AbstractBaseCounterexample<E>
AbstractBaseDTNode<I,D>
AbstractBasePTAState<S extends AbstractBasePTAState<S,SP,TP>,SP,TP>
AbstractBFInclusionOracle<A extends DetOutputAutomaton<?,I,?,D>,I,D>	An InclusionOracle that generates words in a breadth-first manner.
AbstractBFOracle<A extends DeterministicAutomaton<?,I,?>,I,D>	An AutomatonOracle that processes words in a breadth-first manner.
AbstractBFOracleTest<D>	Class to test any AbstractBFOracle.
AbstractBlueFringePTA<S extends AbstractBlueFringePTAState<S,SP,TP>,SP,TP>
AbstractBlueFringePTAState<S extends AbstractBlueFringePTAState<S,SP,TP>,SP,TP>
AbstractBlueFringeRPNI<I,D,SP,TP,M>	Abstract base class for Blue-Fringe-RPNI algorithms.
AbstractCalculator
AbstractContextExecutableInputSUL<I extends ContextExecutableInput<? extends O,? super C>,O,C>	Abstract base class for a SUL that step-wisely executes ContextExecutableInput symbols.
AbstractCounterexample<E>
AbstractDecisionTree<I,D>
AbstractDFALearnerIT	Abstract integration test for DFA learning algorithms.
AbstractDFAPassiveLearnerIT	Abstract integration test for passive DFA learning algorithms.
AbstractDiscriminationTree<DSCR,I,O,D,N extends AbstractDTNode<DSCR,O,D,N>>	An abstract super class for aggregating some information/functionality for discrimination trees.
AbstractDTNode<I,D>
AbstractDTNode<DSCR,O,D,N extends AbstractDTNode<DSCR,O,D,N>>	An abstract super class (DAO) for aggregating some information stored in a node of a discrimination tree.
AbstractDynamicBatchProcessor<Q,P extends BatchProcessor<Q>>	A batch processor that dynamically distributes queries to worker threads.
AbstractDynamicBatchProcessorBuilder<Q,P extends BatchProcessor<Q>,OR>	Builder class for a AbstractDynamicBatchProcessor.
AbstractExplicitAAARLearner<L extends LearningAlgorithm<CM,CI,D> & SupportsGrowingAlphabet<CI>,AM,CM,AI,CI,D>	An "explicit" refinement of the AbstractAAARLearner.
AbstractExtensibleAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP> & SupportsGrowingAlphabet<I>>
AbstractExtensibleAutomatonLStar.BuilderDefaults
AbstractGenericAAARLearner<L extends LearningAlgorithm<CM,CI,D> & SupportsGrowingAlphabet<CI>,AM,CM,AI,CI,D>	A "generic" refinement of the AbstractAAARLearner.
AbstractGrowingAlphabetDFATest<L extends SupportsGrowingAlphabet<Character> & LearningAlgorithm<DFA<?,Character>,Character,Boolean>>
AbstractGrowingAlphabetMealyTest<L extends SupportsGrowingAlphabet<Character> & LearningAlgorithm<MealyMachine<?,Character,?,Character>,Character,Word<Character>>>
AbstractGrowingAlphabetMooreTest<L extends SupportsGrowingAlphabet<Character> & LearningAlgorithm<MooreMachine<?,Character,?,Character>,Character,Word<Character>>>
AbstractGrowingAlphabetTest<L extends SupportsGrowingAlphabet<I> & LearningAlgorithm<M,I,D>,M extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,OR,I,D>	Simple (abstract super) test class that checks the basic workflow of a learning algorithm that implements SupportsGrowingAlphabet.
AbstractHypTrans<I>
Abstraction<AI,CI>	An interface for mapping concrete symbols to their abstraction, and abstractions to their representatives, respectively.
AbstractLStar<A,I,D>	An abstract base class for L*-style algorithms.
AbstractMealyLearnerIT	Abstract integration test for Mealy machine learning algorithms.
AbstractMealyPassiveLearnerIT	Abstract integration test for passive Mealy machine learning algorithms.
AbstractMealySymLearnerIT	Abstract integration test for Mealy machine learning algorithms.
AbstractMooreLearnerIT	Abstract integration test for Moore machine learning algorithms.
AbstractMoorePassiveLearnerIT	Abstract integration test for passive Moore machine learning algorithms.
AbstractMooreSymLearnerIT	Abstract integration test for Moore machine learning algorithms.
AbstractNamedAcexAnalyzer	An abstract counterexample analyzer that carries a name.
AbstractObservationTableWriter<I,D>
AbstractOneSEVPALearnerIT	Abstract integration test for OneSEVPA learning algorithms.
AbstractOPLearner<M extends SuffixOutput<I,D>,I,D,SP,TP>
AbstractOPLearner.BuilderDefaults
AbstractOptimalTTT<M,I,D>
AbstractQuery<I,D>
AbstractResumableLearnerDFATest<L extends Resumable<T> & LearningAlgorithm<DFA<?,Character>,Character,Boolean>,T>
AbstractResumableLearnerMealyTest<L extends Resumable<T> & LearningAlgorithm<MealyMachine<?,Character,?,Character>,Character,Word<Character>>,T>
AbstractResumableLearnerMooreTest<L extends Resumable<T> & LearningAlgorithm<MooreMachine<?,Character,?,Character>,Character,Word<Character>>,T>
AbstractResumableLearnerTest<L extends Resumable<T> & LearningAlgorithm<M,I,D>,M extends UniversalDeterministicAutomaton<?,I,?,?,?>,OR,I,D,T>	Test class that checks the workflow of a learning algorithm that implements Resumable.
AbstractSBALearnerIT	Abstract integration test for SBA learning algorithms.
AbstractSPALearnerIT	Abstract integration test for SPA learning algorithms.
AbstractSPMMLearnerIT	Abstract integration test for SPMM learning algorithms.
AbstractSSTPassiveLearnerIT	Abstract integration test for passive SubsequentialTransducers learning algorithms.
AbstractStaticBatchProcessor<Q,P extends BatchProcessor<Q>>	A batch processor that statically distributes a set of queries among several threads.
AbstractStaticBatchProcessorBuilder<Q,P extends BatchProcessor<Q>,OR>	A builder for a AbstractStaticBatchProcessor.
AbstractStatisticData	Common interface for statistical data.
AbstractSULOmegaOracle<S,I,O,Q>	An omega membership oracle for an ObservableSUL.
AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T extends IntrusiveList<?>,N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>>	An extension of the AbstractDTNode that adds the concept of temporary splitters as well as linking discrimination tree nodes outside their regular tree structure.
AbstractTestWordEQOracle<A extends Output<I,D>,I,D>	An abstract equivalence oracle that takes care of query batching and hypothesis checking and allows extending classes to solely focus on test word generation by implementing AbstractTestWordEQOracle.generateTestWords(Output, Collection).
AbstractTTTHypothesis<S extends TTTState<I,D>,I,D,T>	Hypothesis DFA for the TTT algorithm.
AbstractTTTHypothesis.TTTEdge<I,D>
AbstractTTTLearner<A,I,D>	The TTT learning algorithm for DFA.
AbstractTTTLearner.BuilderDefaults
AbstractTTTLearner.Splitter<I,D>	Data structure for representing a splitter.
AbstractVisualizationTest<L extends LearningAlgorithm<? extends MealyMachine<?,ExampleCoffeeMachine.Input,?,String>,ExampleCoffeeMachine.Input,Word<String>>>	Abstract class for tests that check the visualization of hypotheses or other internal data structure.
AbstractVPALearner<I>
AbstractWordBasedDiscriminationTree<I,O,D>	Convenient class for word-based discrimination trees that already binds certain generics.
AbstractWordBasedDTNode<I,O,D>	Convenient class for word-based discrimination tree nodes that already binds certain generics.
AccessSequenceProvider<I>	Common interface for objects that have an access sequence associated with them (e.g., states and transitions of a hypotheses).
AccessSequenceTransformer<I>
AcexAnalysisAlgorithms
AcexAnalyzer
AcexAnalyzers	This is a utility class, acting as a container for several AbstractNamedAcexAnalyzers.
AcexAnalyzers.Direction
AcexLocalSuffixFinder	Wraps a AbstractNamedAcexAnalyzer.
ADSCalculator
ADT<S,I,O>	The adaptive discrimination tree class.
ADT.LCAInfo<S,I,O>
ADTExtender	Interface for configuration objects that specify how to finalize the temporary splitter given by regular counterexample decomposition.
ADTExtenders	A collection of default ADTExtender configurations.
ADTHypothesis<I,O>	Hypothesis model.
ADTLeafNode<S,I,O>	Leaf node implementation.
ADTLearner<I,O>	The main learning algorithm.
ADTLearnerBuilder<I,O>
ADTLearnerState<S,I,O>	Utility class that captures all essential state of a ADTLearner run.
ADTNode<S,I,O>	The ADT equivalent of ADSNode.
ADTNode.NodeType	Utility enum to distinguish the 3 possible types of ADT nodes.
ADTResetNode<S,I,O>	Reset node implementation.
ADTState<I,O>	Hypothesis state model.
ADTSymbolNode<S,I,O>	Symbol node implementation.
ADTTransition<I,O>	Hypothesis transition model.
ADTUtil	Utility class, that offers some operations revolving around adaptive distinguishing sequences.
ATManager<I>	A manager of access sequences and terminating sequences of SBAs during the learning process.
ATManager<I,O>	A manager of access sequences and terminating sequences of SPMMs during the learning process.
ATRManager<I>	A manager of access sequences, terminating sequences, and return sequences of SPAs during the learning process.
AutomatonLStarState<I,D,AI,S>	Class that contains all data that represent the internal state of the AbstractAutomatonLStar learner and its DFA and Mealy implementations.
AutomatonOracle<A extends DeterministicAutomaton<?,I,?>,I,D>	Finds counterexamples (to particular claims) to a hypothesis, while generating words that are in the given hypothesis.
AutomatonOracle.DFAOracle<I>
AutomatonOracle.MealyOracle<I,O>
BasePTA<S extends AbstractBasePTAState<S,SP,TP>,SP,TP>	Base class for prefix tree acceptors.
BaseTTTDiscriminationTree<I,D>	The discrimination tree data structure.
BatchInterruptedException	Exception that is thrown if a parallel batch is interrupted during processing.
BatchProcessor<T>	A markup interface for classes that can process a batch of work in a parallel environment (e.g. a MembershipOracle when used by a ParallelOracle).
BestEffortCalculator
BestEffortDefensiveCalculator
BinaryDTNode<I,D>	Binary discrimination tree node specialization.
BinaryDTree<I,D>	Binary discrimination tree specialization.
BlackBoxOracle<A extends Output<I,D>,I,D>	Decides whether some words that do not satisfy properties evaluated by BlackBoxOracle.getPropertyOracles() on a given hypothesis, are included in a language.
BlackBoxOracle.DFABlackBoxOracle<I>
BlackBoxOracle.MealyBlackBoxOracle<I,O>
BlockList<I>
BlockList<I,D>	A list for storing blocks (identified by their root AbstractBaseDTNodes).
BlueFringeEDSMDFA<I>	A state-merging learning algorithm based on the evidence principle.
BlueFringeMDLDFA<I>	A state-merging learning algorithm based on the minimal description length principle.
BlueFringePTA<SP,TP>
BlueFringePTAState<SP,TP>
BlueFringeRPNIDFA<I>	A Blue Fringe version of RPNI for learning DFAs.
BlueFringeRPNIMealy<I,O>	Blue-fringe version of RPNI for inferring Mealy machines.
BlueFringeRPNIMoore<I,O>	Blue-fringe version of RPNI for inferring Moore machines.
BooleanMap<V>	Primitive implementation for boolean maps.
BoundedDeque<E>	A generic deque-derived container which transparently acts either as a stack or a queue, and optionally a capacity restriction with a configurable policy which element is evicted (or reject) if the maximum capacity is reached.
BoundedDeque.AccessPolicy	The policy which determines in which order elements are accessed.
BoundedDeque.EvictPolicy	The policy which determines in which order elements are removed if the maximum capacity is reached.
Category	A set of markers that allow one to categorize logging output.
CExFirstOracle<A extends Output<I,D>,I,D>	The strategy of this black-box oracle is to first try out a property, to see if it can be disproved.
Children<I,D>
ClassicLStarDFA<I>	Implementation of the L* algorithm by Dana Angluin.
ClassicLStarDFABuilder<I>
ClassicLStarMealy<I,O>	An implementation of the L*Mealy algorithm for inferring Mealy machines, as described by Oliver Niese in his Ph.D.
ClassicLStarMealyBuilder<I,O>
ClassicLStarMoore<I,O>	A MooreMachine-based specialization of the classic L* learner.
ClassicLStarMooreBuilder<I,O>
ClassicPrefixTransformAcex<I,D>	An abstract counterexample based on prefix transformations.
CloseRandomStrategy
ClosingStrategies	Collection of predefined observation table closing strategies.
ClosingStrategy<I,D>	A closing strategy, determining how to proceed when an observation table needs to be closed.
CompleteExplorationEQOracle<A extends Output<I,D>,I,D>	Implements an equivalence check by complete exploration up to a given depth, i.e., by testing all possible sequences of a certain length within a specified range.
ContextExecutableInput<O,C>	A context executable input is an input that performs a specific action on a SUL itself, given a specific execution context.
ContextExecutableInputSUL<I extends ContextExecutableInput<? extends O,? super C>,O,C>	A SUL that executes ContextExecutableInput symbols.
ContextHandler<C>	Facility for creating and disposing of contexts on which ContextExecutableInputs operate.
ContextPair<I>
Counter	A simple counter.
CounterCollection	A collection of counters.
CounterOracle<I,D>	A MembershipOracle that counts both the number of queries and the total number of symbols occurring in all those queries.
CounterSymbolQueryOracle<I,O>	A simple wrapper for counting the number of resets and symbol queries of a SymbolQueryOracle.
DefaultATManager<I>	A default ATManager that only extracts initial access sequences and terminating sequences from positive counterexamples.
DefaultATManager<I,O>	A default ATManager that only extracts initial access sequences and terminating sequences from positive counterexamples.
DefaultATRManager<I>	A default ATRManager that only extracts initial access sequences, terminating sequences, and return sequences from positive counterexamples.
DefaultExtender
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>
DefaultProcessingOrders	Standard processing orders that can be used for the RPNI algorithm.
DefaultQuery<I,D>	A query is a container for tests a learning algorithms performs, containing the actual test and the corresponding result.
DefensiveADS<S,I,O>	A variant of the backtracking ADS search (see ADS, BacktrackingSearch), that works on partially defined automata.
DefensiveADSCalculator
DFABenchmarks
DFABFEmptinessOracle<I>	This is an auto-generated refinement.
DFABFInclusionOracle<I>	This is an auto-generated refinement.
DFACacheOracle<I>	DFA cache.
DFACacheOracle.DFACacheOracleState<I>
DFACaches	A factory for creating caches for DFA-based MembershipOracles.
DFACExFirstOracle<I>	This is an auto-generated refinement.
DFACompleteExplorationEQOracle<I>	This is an auto-generated refinement.
DFACounterOracle<I>	This is an auto-generated refinement.
DFADisproveFirstOracle<I>	This is an auto-generated refinement.
DFAEQOracleChain<I>	This is an auto-generated refinement.
DFAFinitePropertyOracle<I,P>	A property oracle for DFAs where it is fine to only check finite words from the model checker.
DFAHashCacheOracle<I>	A LearningCacheOracle.DFALearningCacheOracle that uses a Map for internal cache organization.
DFAHashCacheOracle.DFAHashCacheOracleState<I>
DFAHistogramOracle<I>	This is an auto-generated refinement.
DFAIncrementalWMethodEQOracle<I>	This is an auto-generated refinement.
DFALassoEmptinessOracleImpl<S,I>	This is an auto-generated refinement.
DFALassoPropertyOracle<I,P>	A property oracle for DFAs that can check lassos from the model checker.
DFAPropertyOracleChain<I,P>	This is an auto-generated refinement.
DFARandomWMethodEQOracle<I>	This is an auto-generated refinement.
DFARandomWordsEQOracle<I>	This is an auto-generated refinement.
DFARandomWpMethodEQOracle<I>	This is an auto-generated refinement.
DFARefinementCounterLearner<I>	This is an auto-generated refinement.
DFASimulatorEQOracle<I>	This is an auto-generated refinement.
DFASimulatorOracle<I>	This is an auto-generated refinement.
DFAWMethodEQOracle<I>	This is an auto-generated refinement.
DFAWpMethodEQOracle<I>	This is an auto-generated refinement.
DFAWrapper<S extends AbstractBasePTAState<S,Boolean,Void>,I>
DiscriminationTreeIterators	Factory methods for several kinds of discrimination tree node iterators.
DisproveFirstOracle<A extends Output<I,D>,I,D>	The strategy of this black-box oracle is to first try to disprove all properties before finding a counter example to the given hypothesis.
DTInnerNode<I,D>
DTLeaf<I,D>
DTNode<I>
DTree<I>
DynamicParallelOmegaOracle<S,I,D>	A specialized AbstractDynamicBatchProcessor for OmegaMembershipOracles that implements ParallelOmegaOracle.
DynamicParallelOmegaOracleBuilder<S,I,D>	A specialized AbstractDynamicBatchProcessorBuilder for OmegaMembershipOracles.
DynamicParallelOracle<I,D>	A specialized AbstractDynamicBatchProcessor for MembershipOracles that implements ParallelOracle.
DynamicParallelOracleBuilder<I,D>	A specialized AbstractDynamicBatchProcessorBuilder for MembershipOracles.
DynamicSymbolComparator<I>
EmptinessOracle<A extends Output<I,D>,I,D>	Decides whether the intersection of the language of a given hypothesis and some other language (e.g., from a SUL) is empty.
EmptinessOracle.DFAEmptinessOracle<I>
EmptinessOracle.MealyEmptinessOracle<I,O>
EQOracleChain<A,I,D>
EquivalenceOracle<A,I,D>	An equivalence oracle, which checks hypothesis automata against the (possibly unknown) system under learning (SUL).
EquivalenceOracle.DFAEquivalenceOracle<I>	A specialization of the EquivalenceOracle interface for a DFA learning scenario.
EquivalenceOracle.MealyEquivalenceOracle<I,O>	A specialization of the EquivalenceOracle interface for a Mealy learning scenario.
EquivalenceOracle.MooreEquivalenceOracle<I,O>	A specialization of the EquivalenceOracle interface for a Moore learning scenario.
Error	A wrapper for representing an exception-based method output via its Class.getSimpleName().
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)^*.
ExecutableInput<O>	An executable input is an input that performs a specific action on a SUL itself.
ExecutableInputSUL<I extends ExecutableInput<? extends O>,O>	A SUL that executes ExecutableInput symbols.
ExhaustiveReplacer
Experiment<A>	runs a learning experiment.
Experiment.DFAExperiment<I>
Experiment.MealyExperiment<I,O>
Experiment.MooreExperiment<I,O>
ExplicitAAARLearnerDFA<L extends LearningAlgorithm.DFALearner<CI> & SupportsGrowingAlphabet<CI>,AI,CI>	A DFA-specific refinement of AbstractExplicitAAARLearner.
ExplicitAAARLearnerMealy<L extends LearningAlgorithm.MealyLearner<CI,O> & SupportsGrowingAlphabet<CI>,AI,CI,O>	A MealyMachine-specific refinement of AbstractExplicitAAARLearner.
ExplicitAAARLearnerMoore<L extends LearningAlgorithm.MooreLearner<CI,O> & SupportsGrowingAlphabet<CI>,AI,CI,O>	A LearningAlgorithm.MooreLearner-specific refinement of AbstractExplicitAAARLearner.
ExplicitAbstractionTree<AI,CI,D>
ExplicitInitialAbstraction<AI,CI>	This interface denotes an Abstraction that additionally provides an initial classification of abstract input symbols.
ExtensibleLStarDFA<I>	An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper "Learning Regular Sets from Queries and Counterexamples".
ExtensibleLStarDFABuilder<I>
ExtensibleLStarMealy<I,O>
ExtensibleLStarMealyBuilder<I,O>
ExtensibleLStarMoore<I,O>	A MooreMachine-based specialization of the extensible L* learner.
ExtensibleLStarMooreBuilder<I,O>
ExtensionResult<S,I,O>	A class that describes the possible result a ADTExtender can return.
GenerateRefinement	Annotation to indicate that a subclass with the specified configuration should be generated.
GenerateRefinements	Container annotation used in GenerateRefinements Repeatable configuration.
Generic	Definition of a generic parameter.
GenericAAARLearnerDFA<L extends LearningAlgorithm.DFALearner<CI> & SupportsGrowingAlphabet<CI>,AI,CI>	A DFA-specific refinement of AbstractGenericAAARLearner.
GenericAAARLearnerMealy<L extends LearningAlgorithm.MealyLearner<CI,O> & SupportsGrowingAlphabet<CI>,AI,CI,O>	A MealyMachine-specific refinement of AbstractGenericAAARLearner.
GenericAAARLearnerMoore<L extends LearningAlgorithm.MooreLearner<CI,O> & SupportsGrowingAlphabet<CI>,AI,CI,O>	A MooreMachine-specific refinement of AbstractGenericAAARLearner.
GenericAbstractionTree<AI,CI,D>
GenericObservationTable<I,D>	Observation table class.
GlobalSuffixFinder<I,D>	Interface for a global suffix finder.
GlobalSuffixFinders	A collection of suffix-based global counterexample analyzers.
GlobalSuffixLearner<M,I,D>	Common interface for learning algorithms that use a global suffix set.
GlobalSuffixLearner.GlobalSuffixLearnerDFA<I>
GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O>
HistogramDataSet	A simple histogram data set.
HistogramOracle<I,D>	Collects a histogram of passed query lengths.
HState<I,O,SP,TP>
HTransition<I,O,SP,TP>
HypIntTrans<I>
HypLoc<I>
HypothesisChangedException	Exception to indicate structural changes of the hypothesis during counterexample analysis, thus possibly invalidating the counterexample.
HypRetTrans<I>
InclusionOracle<A extends Output<I,D>,I,D>	Decides whether the language of a given hypothesis is included in some other language (e.g., from a SUL).
InclusionOracle.DFAInclusionOracle<I>
InclusionOracle.MealyInclusionOracle<I,O>
IncomingList<I,D>	The head of the intrusive linked list for storing incoming transitions of a DT node.
Inconsistency<I>	An (RFSA) inconsistency in an ObservationTable.
Inconsistency<I>	A description of an inconsistency in an GenericObservationTable.
IncrementalWMethodEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,I,D>
Interface	Definition of an additional inferface.
IntrusiveList<T extends IntrusiveListElem<T>>	The head of the intrusive linked list for storing incoming transitions of a DT node.
IntrusiveListElem<T>	Interface for objects that may occur in a IntrusiveList, either as a value element or the head of the list (which represents the list itself, but does not carry any value).
IntrusiveListElemImpl<T>	An element in an IntrusiveList.
KearnsVaziraniAdapterDFA<I>	Adapter for using KearnsVaziraniDFA as a procedural learner.
KearnsVaziraniAdapterMealy<I,O>	Adapter for using KearnsVaziraniMealy as a procedural learner.
KearnsVaziraniDFA<I>	The Kearns/Vazirani algorithm for learning DFA, as described in the book "An Introduction to Computational Learning Theory" by Michael Kearns and Umesh Vazirani.
KearnsVaziraniDFABuilder<I>
KearnsVaziraniDFAState<I>	Class that contains all data that represent the internal state of the KearnsVaziraniDFA learner.
KearnsVaziraniMealy<I,O>	An adaption of the Kearns/Vazirani algorithm for Mealy machines.
KearnsVaziraniMealyBuilder<I,O>
KearnsVaziraniMealyState<I,O>	Class that contains all data that represent the internal state of the KearnsVaziraniMealy learner.
LassoEmptinessOracle<L extends Lasso<I,D>,I,D>	An emptiness oracle for lassos.
LassoEmptinessOracle.DFALassoEmptinessOracle<I>
LassoEmptinessOracle.MealyLassoEmptinessOracle<I,O>
LassoEmptinessOracleImpl<L extends Lasso<I,D>,S,I,D>
LassoOracle<L extends Lasso<I,D>,I,D>	An automaton oracle for lassos.
LassoOracle.DFALassoOracle<I>
LassoOracle.MealyLassoOracle<I,O>
LCAInfo<O,N>	DAO for aggregating information about the least common ancestor of two subtrees in a discrimination tree.
LeafSplitter	Interface for configuration objects that specify how to split the ADT leaf of a hypothesis state that needs refinement.
LeafSplitters	A collection of default LeafSplitter configurations.
LearnerConstructor<L extends LearningAlgorithm<?,I,D>,I,D>	A simplified view on the constructor of a LearningAlgorithm, that only requires an Alphabet definition and a MembershipOracle.
LearnerITUtil	Utility class for integration tests for a learning algorithm (or "learner").
LearnerVariant<M,I,D>
LearnerVariantList<M,I,D>	A write-only list to store multiple variants of a learning algorithm.
LearnerVariantList.DFALearnerVariantList<I>
LearnerVariantList.MealyLearnerVariantList<I,O>
LearnerVariantList.MealySymLearnerVariantList<I,O>
LearnerVariantList.MooreLearnerVariantList<I,O>
LearnerVariantList.MooreSymLearnerVariantList<I,O>
LearnerVariantList.OneSEVPALearnerVariantList<I>
LearnerVariantList.SBALearnerVariantList<I>
LearnerVariantList.SPALearnerVariantList<I>
LearnerVariantList.SPMMLearnerVariantList<I,O>
LearnerVariantListImpl<M,I,D>
LearnerVariantListImpl.DFALearnerVariantListImpl<I>
LearnerVariantListImpl.MealyLearnerVariantListImpl<I,O>
LearnerVariantListImpl.MealySymLearnerVariantListImpl<I,O>
LearnerVariantListImpl.MooreLearnerVariantListImpl<I,O>
LearnerVariantListImpl.MooreSymLearnerVariantListImpl<I,O>
LearnerVariantListImpl.OneSEVPALearnerVariantListImpl<I>
LearnerVariantListImpl.SBALearnerVariantListImpl<I>
LearnerVariantListImpl.SPALearnerVariantListImpl<I>
LearnerVariantListImpl.SPMMLearnerVariantListImpl<I,O>
LearningAlgorithm<M,I,D>	Basic interface for a model inference algorithm.
LearningAlgorithm.DFALearner<I>
LearningAlgorithm.MealyLearner<I,O>
LearningAlgorithm.MooreLearner<I,O>
LearningAlgorithm.NFALearner<I>
LearningCache<A,I,O>	Interface for a cache used in automata learning.
LearningCache.DFALearningCache<I>	Specialization of the LearningCache interface for DFA learning.
LearningCache.MealyLearningCache<I,O>	Specialization of the LearningCache interface for Mealy machine learning.
LearningCache.MooreLearningCache<I,O>	Specialization of the LearningCache interface for Moore machine learning.
LearningCacheOracle<A,I,D>	A learning cache that also serves as a membership oracle.
LearningCacheOracle.DFALearningCacheOracle<I>	Specialization of the LearningCacheOracle interface for DFA learning.
LearningCacheOracle.MealyLearningCacheOracle<I,O>	Specialization of the LearningCacheOracle interface for Mealy machine learning.
LearningCacheOracle.MooreLearningCacheOracle<I,O>	Specialization of the LearningCacheOracle interface for Moore machine learning.
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>	A LearningExample refinement for StateLocalInputMealyMachine.
LearningExample.UniversalDeterministicLearningExample<I,A extends UniversalAutomaton<?,I,?,?,?>>
LearningExamples
LearnLibLocalPropertiesAutomataLibSettingsSource
LearnLibLocalPropertiesSource
LearnLibPropertiesAutomataLibSettingsSource
LearnLibPropertiesSource
LearnLibProperty	An enum of all the system properties currently used by LearnLib.
LearnLibSettings
LearnLibSettingsSource
LearnLibSystemPropertiesAutomataLibSettingsSource
LearnLibSystemPropertiesSource
LevelOrderReplacer
LocalSuffixFinder<I,D>	Suffix-based local counterexample analyzer.
LocalSuffixFinders	A collection of suffix-based local counterexample analyzers.
LoggingPropertyOracle<I,A extends Output<I,D>,P,D>	A PropertyOracle that performs logging.
LoggingPropertyOracle.DFALoggingPropertyOracle<I,P>
LoggingPropertyOracle.MealyLoggingPropertyOracle<I,O,P>
LStarBaseAdapterDFA<I>	Adapter for using ClassicLStarDFA as a procedural learner.
LStarBaseAdapterMealy<I,O>	Adapter for using ExtensibleLStarMealy as a procedural learner.
LStarDFAUtil
LStarMealyUtil
LStarMooreUtil
MalerPnueliDFA<I>
MalerPnueliDFABuilder<I>
MalerPnueliMealy<I,O>
MalerPnueliMealyBuilder<I,O>
MalerPnueliMoore<I,O>
MalerPnueliMooreBuilder<I,O>
Map	A refinement mapping of (constructor) parameters for the to-be-generated refinement.
MappedException<O>	A mapped exception allows one to gracefully handle exceptions thrown, e.g., during a SUL's step method by providing information about the output symbol that should be emitted instead and subsequent outputs.
MappedOracle<AI,AO,CI,CO>	A utility class that allows to lift a membership oracle of concrete input/output symbols to a membership oracle of abstract input/output symbols, given a corresponding mapper.
MappedSUL<AI,AO,CI,CO>
Mapper<AI,AO,CI,CO>	A mapper that lifts a SUL or MembershipOracle from an "abstract" to a "concrete" level.
Mapper.AsynchronousMapper<AI,AO,CI,CO>	A mapper refinement to establish the contract of an asynchronous, query-wise translation of input words.
Mapper.SynchronousMapper<AI,AO,CI,CO>	A mapper refinement to establish the contract of a synchronized, symbol-wise translation of input words for reactive systems.
Mappers	Utility methods for manipulating mappers.
MealyBFEmptinessOracle<I,O>	This is an auto-generated refinement.
MealyBFInclusionOracle<I,O>	This is an auto-generated refinement.
MealyCacheConsistencyTest<I,O>	An EquivalenceOracle that tests a hypothesis for consistency with the contents of a MealyCacheOracle.
MealyCacheOracle<I,O>	Mealy cache.
MealyCacheOracle.MealyCacheOracleState<I,O>
MealyCaches	A factory for creating caches for mealy-based MembershipOracles.
MealyCExFirstOracle<I,O>	This is an auto-generated refinement.
MealyCompleteExplorationEQOracle<I,O>	This is an auto-generated refinement.
MealyCounterOracle<I,O>	This is an auto-generated refinement.
MealyDHC<I,O>
MealyDHCBuilder<I,O>
MealyDHCState<I,O>	Class that contains all data that represent the internal state of the MealyDHC learner.
MealyDisproveFirstOracle<I,O>	This is an auto-generated refinement.
MealyEQOracleChain<I,O>	This is an auto-generated refinement.
MealyFinitePropertyOracle<I,O,P>	A property oracle for Mealy Machines where it is fine to only check finite words from the model checker.
MealyHistogramOracle<I,O>	This is an auto-generated refinement.
MealyIncrementalWMethodEQOracle<I,O>	This is an auto-generated refinement.
MealyLassoEmptinessOracleImpl<S,I,O>	This is an auto-generated refinement.
MealyLassoPropertyOracle<I,O,P>	A property oracle for Mealy machines that can check lassos from the model checker.
MealyOutInconsPrefixTransformAcex<I,O>
MealyPropertyOracleChain<I,O,P>	This is an auto-generated refinement.
MealyRandomWMethodEQOracle<I,O>	This is an auto-generated refinement.
MealyRandomWordsEQOracle<I,O>	This is an auto-generated refinement.
MealyRandomWpMethodEQOracle<I,O>	This is an auto-generated refinement.
MealyRefinementCounterLearner<I,O>	This is an auto-generated refinement.
MealySimulatorEQOracle<I,O>	This is an auto-generated refinement.
MealySimulatorOracle<I,O>	This is an auto-generated refinement.
MealySimulatorSUL<I,O>	A SUL that implements steps by stepping through a MealyMachine.
MealyUtil	Utility class helping to unify various approaches to actively learning Mealy machines.
MealyWMethodEQOracle<I,O>	This is an auto-generated refinement.
MealyWpMethodEQOracle<I,O>	This is an auto-generated refinement.
MealyWrapper<S extends AbstractBasePTAState<S,Void,O>,I,O>
MembershipOracle<I,D>	Membership oracle interface.
MembershipOracle.DFAMembershipOracle<I>	A specialization of the MembershipOracle that binds the output domain to Booleans.
MembershipOracle.MealyMembershipOracle<I,O>	A specialization of the MembershipOracle that binds the output domain to Words of the specified output type.
MembershipOracle.MooreMembershipOracle<I,O>	A specialization of the MembershipOracle that binds the output domain to Words of the specified output type.
MethodInput	An input symbol that represents a call to a method with a specific set of parameters.
MethodOutput	Abstract output of a method.
MinLengthCalculator
MinSizeCalculator
MooreCacheConsistencyTest<I,O>	An EquivalenceOracle that tests a hypothesis for consistency with the contents of a MooreCacheOracle.
MooreCacheOracle<I,O>	Moore cache.
MooreCacheOracle.MooreCacheOracleState<I,O>
MooreCaches	A factory for creating caches for Moore-based MembershipOracles.
MooreCompleteExplorationEQOracle<I,O>	This is an auto-generated refinement.
MooreCounterOracle<I,O>	This is an auto-generated refinement.
MooreEQOracleChain<I,O>	This is an auto-generated refinement.
MooreIncrementalWMethodEQOracle<I,O>	This is an auto-generated refinement.
MooreOutInconsPrefixTransformAcex<I,O>
MooreOutputHistogramOracle<I,O>	This is an auto-generated refinement.
MooreRandomWMethodEQOracle<I,O>	This is an auto-generated refinement.
MooreRandomWordsEQOracle<I,O>	This is an auto-generated refinement.
MooreRandomWpMethodEQOracle<I,O>	This is an auto-generated refinement.
MooreRefinementCounterLearner<I,O>	This is an auto-generated refinement.
MooreSimulatorEQOracle<I,O>	This is an auto-generated refinement.
MooreSimulatorOracle<I,O>	This is an auto-generated refinement.
MooreUtil	Utility class helping to unify various approaches to actively learning Moore machines.
MooreWMethodEQOracle<I,O>	This is an auto-generated refinement.
MooreWpMethodEQOracle<I,O>	This is an auto-generated refinement.
MooreWrapper<S extends AbstractBasePTAState<S,O,Void>,I,O>
MQUtil
MultiDTNode<I,O,D>	Generic n-ary discrimination tree node specialization.
MultiDTree<I,O,D>	Generic n-ary discrimination tree specialization.
MutableObservationTable<I,D>
NFALearnerWrapper<I>
NFASimulatorOracle<I>	This is an auto-generated refinement.
NLStarLearner<I>	The NL* learner.
NLStarLearnerBuilder<I>
ObservableMealySimulatorSUL<S,I,O>
ObservableSUL<S,I,O>	A System Under Learning (SUL) where at any point in time the internal state can be observed.
ObservationPackAdapterDFA<I>	Adapter for using OPLearnerDFA as a procedural learner.
ObservationPackAdapterMealy<I,O>	Adapter for using OPLearnerMealy as a procedural learner.
ObservationTable<I>	The observation table implementation for the NL* algorithm.
ObservationTable<I,D>	An observation table is a common method for learning algorithms to store organize their observations.
ObservationTableASCIIWriter<I,D>
ObservationTableCEXHandler<I,D>
ObservationTableCEXHandlers
ObservationTableFeature<I,D>
ObservationTableHTMLWriter<I,D>	Writes an observation table as an HTML table.
ObservationTableReader<I,D>	Reads an ObservationTable from a string source.
ObservationTableWriter<I,D>
ObservationTree<S,I,O>	A class, that stores observations of the system under learning in a tree-like structure.
OmegaMembershipOracle<S,I,D>	Answers OmegaQuerys, similar to a MembershipOracle.
OmegaMembershipOracle.DFAOmegaMembershipOracle<S,I>
OmegaMembershipOracle.MealyOmegaMembershipOracle<S,I,O>
OmegaQuery<I,D>	A query that represents information about infinite words in an ultimately periodic pattern.
OmegaQueryAnswerer<S,I,D>	Answers OmegaQuerys.
OneSEVPAHypothesis<I>
OneSEVPALearnerITCase<I>
OPLearnerDFA<I>	Algorithm for learning DFA using the Discrimination Tree algorithm.
OPLearnerDFABuilder<I>
OPLearnerHypothesis<I,O,SP,TP>	Basic hypothesis data structure for Discrimination Tree learning algorithms.
OPLearnerMealy<I,O>
OPLearnerMealyBuilder<I,O>
OPLearnerMoore<I,O>	A MooreMachine-based specialization of the DT learner.
OPLearnerMooreBuilder<I,O>
OPLearnerState<I,D,SP,TP>	Class that contains all data that represent the internal state of the OPLearnerState learner and its DFA and Mealy implementations.
OPLearnerVPA<I>
OPLearnerVPABuilder<I>
OptimalLStarDFA<I>
OptimalLStarMealy<I,O>
OptimalLStarState<I,D>	State class for making OptimalLStarDFA and OptimalLStarMealy resumable.
OptimalTTTAdapterDFA<I>	Adapter for using OptimalTTTDFA as a procedural learner.
OptimalTTTAdapterMealy<I,O>	Adapter for using OptimalTTTMealy as a procedural learner.
OptimalTTTDFA<I>
OptimalTTTMealy<I,O>
OptimizingATManager<I>	An optimizing ATManager that continuously scans positive counterexamples and procedural models in order to find shorter access sequences and terminating sequences.
OptimizingATManager<I,O>	An optimizing ATManager that continuously scans positive counterexamples and procedural models in order to find shorter access sequences and terminating sequences.
OptimizingATRManager<I>	An optimizing ATRManager that continuously scans positive counterexamples and procedural models in order to find shorter access sequences, terminating sequences, and return sequences.
OSTIA<I,O>	The OSTIA learning algorithm.
OTLearner<M,I,D>
OTLearner.OTLearnerDFA<I>
OTLearner.OTLearnerMealy<I,O>
OTLearner.OTLearnerMoore<I,O>
OTUtils
OutInconsPrefixTransformAcex<I,D>	An abstract counterexample for output inconsistencies, based on prefix transformations.
OutputInconsistency<I,D>	Class for representing output inconsistencies within the TTT algorithm.
ParallelOmegaOracle<S,I,D>	ParallelOracle equivalent for OmegaMembershipOracle.
ParallelOracle<I,D>	Basic interface for MembershipOracles that can process queries in parallel.
ParallelOracleBuilders	Builders for (static and dynamic) parallel oracles.
PartialTransitionAnalyzer<S,I>	During the refinement process of the hypothesis, ADS/Ts may be computed on partially defined automata.
PartialTransitionAnalyzer.HypothesisModificationException	A helper exception to interrupt computations on an invalid hypothesis.
PassiveLearnerVariant<M,I,D>
PassiveLearnerVariantITCase<I,D,M extends SuffixOutput<I,D>>	Default test case for a passive learning integration test.
PassiveLearnerVariantList<M,I,D>
PassiveLearnerVariantList.DFALearnerVariantList<I>
PassiveLearnerVariantList.MealyLearnerVariantList<I,O>
PassiveLearnerVariantList.MooreLearnerVariantList<I,O>
PassiveLearnerVariantList.SSTLearnerVariantList<I,O>
PassiveLearnerVariantListImpl<M,I,D>
PassiveLearnerVariantListImpl.DFAPassiveLearnerVariantListImpl<I>
PassiveLearnerVariantListImpl.MealyLearnerVariantListImpl<I,O>
PassiveLearnerVariantListImpl.MooreLearnerVariantListImpl<I,O>
PassiveLearnerVariantListImpl.SSTLearnerVariantListImpl<I,O>
PassiveLearningAlgorithm<M,I,D>
PassiveLearningAlgorithm.PassiveAcceptorLearner<M extends FiniteStateAcceptor<?,I>,I>	Basic interface for passive learning algorithms that infer finite-state acceptors (DFAs or NFAs).
PassiveLearningAlgorithm.PassiveDFALearner<I>	Basic interface for passive learning algorithms that infer DFAs.
PassiveLearningAlgorithm.PassiveMealyLearner<I,O>	Basic interface for passive learning algorithms that infer Mealy machines.
PassiveLearningAlgorithm.PassiveMooreLearner<I,O>	Basic interface for passive learning algorithms that infer Moore machines.
PassiveLearningExample<I,D>
PassiveLearningExample.DFAPassiveLearningExample<I>
PassiveLearningExample.MealyPassiveLearningExample<I,O>
PassiveLearningExample.MoorePassiveLearningExample<I,O>
PassiveLearningExample.SSTPassiveLearningExample<I,O>
PrefixTree<I,D>
PrefixTTTLearnerDFA<I>
PrefixTTTLearnerDFA.ExtDTNode<I>
ProcessingOrder	Interface for entities that specify the order in which blue states are processed (i.e., considered for merges).
PropertyOracle<I,A extends Output<I,D>,P,D>	A PropertyOracle can disprove a property, and used to find a counter example to a hypothesis.
PropertyOracle.DFAPropertyOracle<I,P>
PropertyOracle.MealyPropertyOracle<I,O,P>
PropertyOracleChain<I,A extends Output<I,D>,P,D>	A chain of property oracles.
PTATransition<S extends AbstractBasePTAState<S,?,?>>
PTNode<I,D>
PTNodeImpl<I,D>
Query<I,D>	A query is the basic form of interaction between a learner and a (membership) oracle, or teacher.
QueryAnswerer<I,D>
RandomWalkEQOracle<I,O>	Performs a random walk over the hypothesis.
RandomWellMatchedWordsEQOracle<I>	An equivalence oracle based on the generation of random (well-matched) words.
RandomWMethodEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,I,D>	Implements an equivalence test by applying the W-method test on the given hypothesis automaton.
RandomWordsEQOracle<A extends Output<I,D>,I,D>
RandomWpMethodEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,I,D>	Implements an equivalence test by applying the Wp-method test on the given hypothesis automaton, as described in "Test Selection Based on Finite State Models" by S.
RedBlueMerge<S extends AbstractBlueFringePTAState<S,SP,TP>,SP,TP>
RefinementCounterLearner<M,I,D>	Counts the number of hypothesis refinements.
RefinementProcessor
ReplacementResult<S,I,O>	A class that describes the possible result a SubtreeReplacer can return.
ResetCounterObservableSUL<S,I,O>
ResetCounterStateLocalInputSUL<I,O>
ResetCounterSUL<I,O>
Resumable<T>	Data structures that implement this interface can be "suspended" by means of exposing a state object that contains all data that is necessary to resume from this state at a later point in time.
ResumeUtils	Utility functions for Resumable features.
ReturnValue<T>	A (non-empty) output of a method call.
ReuseCapableOracle<S,I,O>	Required interface for the ReuseOracle.
ReuseCapableOracle.QueryResult<S,O>
ReuseEdge<S,I,O>	A ReuseEdge connects two ReuseNode's in the ReuseTree and is labeled with input and output behavior.
ReuseException	This exception will be thrown whenever some nondeterministic behavior in the reuse tree is detected when inserting new queries.
ReuseNode<S,I,O>	A ReuseNode is a vertex in the ReuseTree that contains (a possible empty) set of outgoing ReuseEdges.
ReuseNode.NodeResult<S,I,O>
ReuseOracle<S,I,O>	The reuse oracle is a MembershipOracle.MealyMembershipOracle that is able to Cache queries: Each processed query will not be delegated again (instead the answer will be retrieved from the ReuseTree) Pump queries: If the ReuseTree is configured to know which symbols are model invariant input symbols via ReuseOracle.ReuseOracleBuilder.withInvariantInputs(Set) (like a read from a database which does not change the SUL) or configured for failure output symbols via ReuseOracle.ReuseOracleBuilder.withFailureOutputs(Set) (e.g. a roll back mechanism exists for the invoked symbol) the oracle could ''pump'' those symbols inside a query once seen. Reuse system states: There are a lot of situations where a prefix of a query is already known and a system state is available.
ReuseOracle.ReuseOracleBuilder<S,I,O>
ReuseTree<S,I,O>	The ReuseTree is a tree like structure consisting of nodes (see ReuseNode) and edges (see ReuseEdge) that is used by the ReuseOracle: Nodes may contain a system state (see ReuseNode.fetchSystemState(boolean)) that could be used for executing suffixes of membership queries.
ReuseTree.ReuseTreeBuilder<S,I,O>
ReverseLexCmp<I>
RivestSchapireAdapterDFA<I>	Adapter for using RivestSchapireDFA as a procedural learner.
RivestSchapireAdapterMealy<I,O>	Adapter for using RivestSchapireMealy as a procedural learner.
RivestSchapireDFA<I>
RivestSchapireDFABuilder<I>
RivestSchapireMealy<I,O>
RivestSchapireMealyBuilder<I,O>
RivestSchapireMoore<I,O>
RivestSchapireMooreBuilder<I,O>
Row<I>	A single row in the ObservationTable for NL*.
Row<I>	A row in an observation table.
SampleSetEQOracle<I,D>	An equivalence oracle that tests a hypothesis against a fixed set of sample queries.
SBALearner<I,L extends LearningAlgorithm.DFALearner<SymbolWrapper<I>> & SupportsGrowingAlphabet<SymbolWrapper<I>> & AccessSequenceTransformer<SymbolWrapper<I>>>	A learning algorithm for SBAs.
SBALearnerITCase<I>
SBASimulatorOracle<I>	This is an auto-generated refinement.
SEVPASimulatorOracle<I>	This is an auto-generated refinement.
SimpleObservationTable<I,D>	This class represents the data structure of an ObservationTable without providing any meaningful functionality.
SimplePOJOExceptionMapper	A mapper that wraps any kind of RuntimeException that occurs during steps of the SimplePOJOTestDriver into a MappedException whose output is an Error object, followed by repeated Unobserved outputs.
SimplePOJOTestDriver	A test driver for plain old java objects.
SimpleProfiler	Very rudimentary profiler.
SimulatorEQOracle<I>
SimulatorEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?>,I,D>
SimulatorEQOracle<I>
SimulatorEQOracle<I,O>
SimulatorEQOracle<I>	An equivalence oracle based on the computation of a separating word for a given hypothesis and a previously known target system.
SimulatorOmegaOracle<S,I,D>	Answers OmegaQuerys by simulating an automaton.
SimulatorOmegaOracle.DFASimulatorOmegaOracle<S,I>
SimulatorOmegaOracle.MealySimulatorOmegaOracle<S,I,O>
SimulatorOracle<I,D>	A membership oracle backed by an automaton.
SingleQueryOmegaOracle<S,I,D>	An OmegaMembershipOracle that answers single queries.
SingleQueryOmegaOracle.SingleQueryOmegaOracleDFA<S,I>
SingleQueryOmegaOracle.SingleQueryOmegaOracleMealy<S,I,O>
SingleQueryOracle<I,D>	Base interface for oracles whose semantic is defined in terms of directly answering single queries (like a QueryAnswerer), and that cannot profit from batch processing of queries.
SingleQueryOracle.SingleQueryOracleDFA<I>
SingleQueryOracle.SingleQueryOracleMealy<I,O>
SingleQueryOracle.SingleQueryOracleMoore<I,O>
SingleReplacer
SLICounterStateLocalInputSUL<I,O>
SPALearner<I,L extends LearningAlgorithm.DFALearner<I> & SupportsGrowingAlphabet<I> & AccessSequenceTransformer<I>>	A learning algorithm for SPAs.
SPALearnerITCase<I>
SPASimulatorOracle<I>	This is an auto-generated refinement.
SplitData<O,T extends IntrusiveList<?>>	Data associated with a discrimination tree node while an enclosing subtree is being split.
Splitter<I>	Data structure for representing a splitter.
Splitter.SplitType
SPMMLearner<I,O,L extends LearningAlgorithm.MealyLearner<SymbolWrapper<I>,O> & SupportsGrowingAlphabet<SymbolWrapper<I>> & AccessSequenceTransformer<SymbolWrapper<I>>>	A learning algorithm for SPMMs.
SPMMLearnerITCase<I,O>
SPMMSimulatorOracle<I,O>	This is an auto-generated refinement.
SQOOTBridge<I,O>	A utility class that links an observation tree with a symbol query oracle, meaning that all queries to the symbol query oracle will be stored in the observation tree.
State
StateInfo<I,D>	The information associated with a state: it's access sequence (or access string), and the list of incoming transitions.
StateLocalInputMealySimulatorEQOracle<I,O>
StateLocalInputMealySimulatorSUL<I,O>
StateLocalInputSUL<I,O>	A System Under Learning (SUL) which can additionally report the inputs that the SUL can process in its current state, i.e. inputs that will not trigger a SULException when used in the next invocation of the SUL.step(Object) method return an otherwise "undefined" behavior.
StateLocalInputSULCache<I,O>	A SULCache that additionally caches the currently enabled inputs of the given StateLocalInputSUL.
StateLocalInputSULCache.StateLocalInputSULCacheState<I,O>
StateLocalInputSULOracle<I,O>	A wrapper around a system under learning (SUL) with state local inputs.
StateLocalInputSULSymbolQueryOracle<I,O>	A SymbolQueryOracle wrapper for StateLocalInputSULs.
StaticParallelOmegaOracle<S,I,D>	A specialized AbstractStaticBatchProcessor for OmegaMembershipOracles that implements ParallelOmegaOracle.
StaticParallelOmegaOracleBuilder<S,I,D>	A specialized AbstractStaticBatchProcessorBuilder for OmegaMembershipOracles.
StaticParallelOracle<I,D>	A specialized AbstractStaticBatchProcessor for MembershipOracles that implements ParallelOracle.
StaticParallelOracleBuilder<I,D>	A specialized AbstractStaticBatchProcessorBuilder for MembershipOracles.
StatisticCollector	A utility interface to indicate that the implementing class collects statistical information that may be obtained via its StatisticCollector.getStatisticalData() method.
StatisticData	Common interface for statistical data.
StatisticLearner<M,I,D>	Common interface for learners keeping statistics.
StatisticLearner.DFAStatisticLearner<I>
StatisticLearner.MealyStatisticLearner<I,O>
StatisticLearner.MooreStatisticLearner<I,O>
StatisticOracle<I,D>	Common interface for oracles keeping statistics.
StatisticSUL<I,O>
STNode<I>
StringMapper<CI>
SubtreeReplacer	Interface for configuration objects that specify how nodes of the current ADT should be replaced.
SubtreeReplacers	A collection of default SubtreeReplacer configurations.
SuffixASCIIReader<I,D>
SuffixASCIIWriter<I,D>	A de.learnlib.datastructures.writer which stores the suffixes of an ObservationTable in plaintext.
SuffixTrie<I>
SUL<I,O>	Interface for a system under learning (SUL) that can make single steps.
SULCache<I,O>	A cache to be used with a SUL.
SULCaches	A factory for creating caches for SULs.
SULException	Unchecked exception class that can be used by implementors of a SUL to wrap any exceptions that occur during the SUL.step(Object) methods.
SULMapper<AI,AO,CI,CO>	An extension of the Mapper interface specifically for SULs.
SULMappers	Utility methods for manipulating mappers.
SULOracle<I,O>	A wrapper around a system under learning (SUL).
SULSymbolQueryOracle<I,O>	A wrapper that allows to use a SUL where a SymbolQueryOracle is expected.
SymbolCounterObservableSUL<S,I,O>
SymbolCounterStateLocalInputSUL<I,O>
SymbolCounterSUL<I,O>
SymbolEQOracleWrapper<A extends DetSuffixOutputAutomaton<?,I,?,Word<O>>,I,O>
SymbolQueryCache<I,O>	A cache for a SymbolQueryOracle.
SymbolQueryCache.SymbolQueryCacheState<I,O>
SymbolQueryOracle<I,O>	Symbol query interface.
SymbolWrapper<I>	A utility class to annotate an input symbol with a (boolean) continuable flag.
SystemStateHandler<S>	AN implementation of this interface that is set to the ReuseTree (see ReuseOracle.ReuseOracleBuilder.withSystemStateHandler(SystemStateHandler)) will be informed about all removed system states whenever ReuseTree.disposeSystemStates() gets called.
ThreadPool	A markup interface for a component that manages a pool of threads that may want to be shut down after usage.
ThreadPool.PoolPolicy	The policy for dealing with thread pools.
ThreadSafeDFACacheOracle<I>	A thread-safe variant of DFACacheOracle.
ThreadSafeDFACaches	A factory for creating thread-safe caches for DFA-based MembershipOracles.
ThreadSafeMealyCacheConsistencyTest<I,O>	A thread-safe variant of EquivalenceOracle.MealyEquivalenceOracle.
ThreadSafeMealyCacheOracle<I,O>	A thread-safe variant of MealyCacheOracle.
ThreadSafeMealyCaches	A factory for creating thread-safe caches for MealyMachine-based MembershipOracles.
ThreadSafeMooreCacheConsistencyTest<I,O>	A thread-safe variant of EquivalenceOracle.MooreEquivalenceOracle.
ThreadSafeMooreCacheOracle<I,O>	A thread-safe variant of MealyCacheOracle.
ThreadSafeMooreCaches	A factory for creating thread-safe caches for MooreMachine-based MembershipOracles.
ThreadSafeStateLocalInputSULCache<I,O>	A thread-safe variant of StateLocalInputSULCache.
ThreadSafeSULCache<I,O>	A thread-safe variant of SULCache.
ThreadSafeSULCaches	A factory for creating thread-safe SUL caches.
TranslatingDFA<S,AI,CI>
TranslatingMealyMachine<S,AI,CI,T,O>
TranslatingMooreMachine<S,AI,CI,T,O>
TransList<I>
TTTAdapterDFA<I>	Adapter for using TTTLearnerDFA as a procedural learner.
TTTAdapterMealy<I,O>	Adapter for using TTTLearnerMealy as a procedural learner.
TTTDTNodeDFA<I>	Binary discrimination tree node specialization.
TTTDTNodeMealy<I,D>	Generic n-ary discrimination tree node specialization.
TTTDTNodeMoore<I,D>	A MooreMachine-based specialization of the DT node.
TTTHypothesisDFA<I>
TTTHypothesisMealy<I,O>
TTTHypothesisMoore<I,O>	A MooreMachine-based specialization of the TTT hypothesis.
TTTLearnerDFA<I>
TTTLearnerDFABuilder<I>
TTTLearnerMealy<I,O>
TTTLearnerMealyBuilder<I,O>
TTTLearnerMoore<I,O>	A MooreMachine-based specialization of the TTT learner.
TTTLearnerMooreBuilder<I,O>
TTTLearnerState<I,D>	Class that contains all data that represent the internal state of the AbstractTTTLearner learner and its DFA and Mealy implementations.
TTTLearnerVPA<I>
TTTLearnerVPABuilder<I>
TTTState<I,D>	A state in a AbstractTTTHypothesis.
TTTStateDFA<I>
TTTStateMoore<I,O>	A MooreMachine-specific state of the TTTHypothesisMoore class.
TTTTransition<I,D>	A transition in a AbstractTTTHypothesis.
TTTTransitionMealy<I,O>
UniversalDeterministicLearnerITCase<I,D,M extends UniversalDeterministicAutomaton<?,I,?,?,?>>
Unobserved	An artificial output symbol for a (non-executed) input after an exception has occurred.
VoidOutput	The (empty) output of a void method call.
WMethodEQOracle<I>	An SBA version of WMethodEQOracle which generates test sequences based on the W-method for each procedure.
WMethodEQOracle<I>	An SPA version of WMethodEQOracle which generates test sequences based on the W-method for each procedure.
WMethodEQOracle<I,O>	Implements an equivalence test by applying the W-method test on the procedures of the given hypothesis SBA, as described in "Testing software design modeled by finite state machines" by T.S.
WMethodEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,I,D>	Implements an equivalence test by applying the W-method test on the given hypothesis automaton, as described in "Testing software design modeled by finite state machines" by T.S.
WpMethodEQOracle<I>	An SPA version of WpMethodEQOracle which generates test sequences based on the partial W-method for each procedure.
WpMethodEQOracle<A extends UniversalDeterministicAutomaton<?,I,?,?,?> & Output<I,D>,I,D>	Implements an equivalence test by applying the Wp-method test on the given hypothesis automaton, as described in "Test Selection Based on Finite State Models" by S.