Uses of Interface
de.learnlib.AccessSequenceTransformer

Packages that use AccessSequenceTransformer

Package	Description
de.learnlib.algorithm.adt.automaton
de.learnlib.algorithm.dhc.mealy
de.learnlib.algorithm.observationpack.hypothesis
de.learnlib.algorithm.procedural.adapter.dfa
de.learnlib.algorithm.procedural.adapter.mealy
de.learnlib.algorithm.procedural.sba
de.learnlib.algorithm.procedural.spa
de.learnlib.algorithm.procedural.spmm
de.learnlib.counterexample	This package contains a collection of standard algorithms for handling counterexamples in automata learning.
de.learnlib.datastructure.observationtable
de.learnlib.datastructure.observationtable.reader

Uses of AccessSequenceTransformer in de.learnlib.algorithm.adt.automaton

Classes in de.learnlib.algorithm.adt.automaton that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	ADTHypothesis<I,O>	Hypothesis model.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.dhc.mealy

Classes in de.learnlib.algorithm.dhc.mealy that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	MealyDHC<I,O>	The DHC learner.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.observationpack.hypothesis

Classes in de.learnlib.algorithm.observationpack.hypothesis that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	OPLearnerHypothesis<I,O,SP,TP>	Basic hypothesis data structure for Discrimination Tree learning algorithms.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.procedural.adapter.dfa

Classes in de.learnlib.algorithm.procedural.adapter.dfa that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	KearnsVaziraniAdapterDFA<I>	Adapter for using KearnsVaziraniDFA as a procedural learner.
class	LLambdaAdapterDFA<I>	Adapter for using LLambdaDFA as a procedural learner.
class	LStarBaseAdapterDFA<I>	Adapter for using ClassicLStarDFA as a procedural learner.
class	ObservationPackAdapterDFA<I>	Adapter for using OPLearnerDFA as a procedural learner.
class	RivestSchapireAdapterDFA<I>	Adapter for using RivestSchapireDFA as a procedural learner.
class	TTTAdapterDFA<I>	Adapter for using TTTLearnerDFA as a procedural learner.
class	TTTLambdaAdapterDFA<I>	Adapter for using TTTLambdaDFA as a procedural learner.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.procedural.adapter.mealy

Classes in de.learnlib.algorithm.procedural.adapter.mealy that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	KearnsVaziraniAdapterMealy<I,O>	Adapter for using KearnsVaziraniMealy as a procedural learner.
class	LLambdaAdapterMealy<I,O>	Adapter for using LLambdaMealy as a procedural learner.
class	LStarBaseAdapterMealy<I,O>	Adapter for using ExtensibleLStarMealy as a procedural learner.
class	ObservationPackAdapterMealy<I,O>	Adapter for using OPLearnerMealy as a procedural learner.
class	RivestSchapireAdapterMealy<I,O>	Adapter for using RivestSchapireMealy as a procedural learner.
class	TTTAdapterMealy<I,O>	Adapter for using TTTLearnerMealy as a procedural learner.
class	TTTLambdaAdapterMealy<I,O>	Adapter for using TTTLambdaMealy as a procedural learner.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.procedural.sba

Classes in de.learnlib.algorithm.procedural.sba with type parameters of type AccessSequenceTransformer

Modifier and Type	Class	Description
class	SBALearner<I,L extends LearningAlgorithm.DFALearner<SymbolWrapper<I>> & net.automatalib.alphabet.SupportsGrowingAlphabet<SymbolWrapper<I>> & AccessSequenceTransformer<SymbolWrapper<I>>>	A learning algorithm for SBAs.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.procedural.spa

Classes in de.learnlib.algorithm.procedural.spa with type parameters of type AccessSequenceTransformer

Modifier and Type	Class	Description
class	SPALearner<I,L extends LearningAlgorithm.DFALearner<I> & net.automatalib.alphabet.SupportsGrowingAlphabet<I> & AccessSequenceTransformer<I>>	A learning algorithm for SPAs.

Uses of AccessSequenceTransformer in de.learnlib.algorithm.procedural.spmm

Classes in de.learnlib.algorithm.procedural.spmm with type parameters of type AccessSequenceTransformer

Modifier and Type	Class	Description
class	SPMMLearner<I,O,L extends LearningAlgorithm.MealyLearner<SymbolWrapper<I>,O> & net.automatalib.alphabet.SupportsGrowingAlphabet<SymbolWrapper<I>> & AccessSequenceTransformer<SymbolWrapper<I>>>	A learning algorithm for SPMMs.

Uses of AccessSequenceTransformer in de.learnlib.counterexample

Methods in de.learnlib.counterexample with parameters of type AccessSequenceTransformer

Modifier and Type	Method	Description
static <I,D> List<net.automatalib.word.Word<I>>	GlobalSuffixFinders.findLinear(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle, boolean allSuffixes)	Returns the suffix (plus all of its suffixes, if allSuffixes is true) found by the access sequence transformation in ascending linear order.
static <I,D> int	LocalSuffixFinders.findLinear(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle)	Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.
static <I,D> List<net.automatalib.word.Word<I>>	GlobalSuffixFinders.findLinearReverse(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle, boolean allSuffixes)	Returns the suffix (plus all of its suffixes, if allSuffixes is true) found by the access sequence transformation in descending linear order.
static <I,D> int	LocalSuffixFinders.findLinearReverse(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle)	Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.
static <I,D> List<net.automatalib.word.Word<I>>	GlobalSuffixFinders.findRivestSchapire(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle, boolean allSuffixes)	Returns the suffix (plus all of its suffixes, if allSuffixes is true) found by the binary search access sequence transformation.
static <I,D> int	LocalSuffixFinders.findRivestSchapire(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer, net.automatalib.automaton.concept.SuffixOutput<I,D> hypOutput, MembershipOracle<I,D> oracle)	Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations using a binary search, as proposed by Rivest & Schapire.
static <I,D> List<net.automatalib.word.Word<I>>	GlobalSuffixFinders.findShahbaz(Query<I,D> ceQuery, AccessSequenceTransformer<I> asTransformer)	Returns all suffixes of the counterexample word as distinguishing suffixes, after stripping a maximal one-letter extension of an access sequence, as suggested by Shahbaz.
<RI extends I,RD extends D> List<net.automatalib.word.Word<RI>>	GlobalSuffixFinder.findSuffixes(Query<RI,RD> ceQuery, AccessSequenceTransformer<RI> asTransformer, net.automatalib.automaton.concept.SuffixOutput<RI,RD> hypOutput, MembershipOracle<RI,RD> oracle)	Finds a set of distinguishing suffixes which will allow to expose at least one additional state in the hypothesis.
static <RI,RO> int	AcexLocalSuffixFinder.findSuffixIndex(AcexAnalyzer analyzer, boolean reduce, Query<RI,RO> ceQuery, AccessSequenceTransformer<RI> asTransformer, net.automatalib.automaton.concept.SuffixOutput<RI,RO> hypOutput, MembershipOracle<RI,RO> oracle)
<RI,RO> int	AcexLocalSuffixFinder.findSuffixIndex(Query<RI,RO> ceQuery, AccessSequenceTransformer<RI> asTransformer, net.automatalib.automaton.concept.SuffixOutput<RI,RO> hypOutput, MembershipOracle<RI,RO> oracle)
<RI extends I,RD extends D> int	LocalSuffixFinder.findSuffixIndex(Query<RI,RD> ceQuery, AccessSequenceTransformer<RI> asTransformer, net.automatalib.automaton.concept.SuffixOutput<RI,RD> hypOutput, MembershipOracle<RI,RD> oracle)	Finds, for a given counterexample, a "split index", such that: - the part of the query word before this index leads to the state being split - the part of the query word from this index on is a suffix capable of splitting this state.

Uses of AccessSequenceTransformer in de.learnlib.datastructure.observationtable

Subinterfaces of AccessSequenceTransformer in de.learnlib.datastructure.observationtable

Modifier and Type	Interface	Description
interface	MutableObservationTable<I,D>
interface	ObservationTable<I,D>	An observation table is a common method for learning algorithms to store organize their observations.

Classes in de.learnlib.datastructure.observationtable that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	GenericObservationTable<I,D>	Observation table class.

Uses of AccessSequenceTransformer in de.learnlib.datastructure.observationtable.reader

Classes in de.learnlib.datastructure.observationtable.reader that implement AccessSequenceTransformer

Modifier and Type	Class	Description
class	SimpleObservationTable<I,D>	This class represents the data structure of an ObservationTable without providing any meaningful functionality.