Uses of Interface
de.learnlib.api.AccessSequenceTransformer

Packages that use AccessSequenceTransformer

Package	Description
de.learnlib.algorithms.dhc.mealy
de.learnlib.algorithms.lstargeneric.table
de.learnlib.counterexamples

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

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

Modifier and Type	Class and Description
class	MealyDHC<I,O>

Uses of AccessSequenceTransformer in de.learnlib.algorithms.lstargeneric.table

Classes in de.learnlib.algorithms.lstargeneric.table that implement AccessSequenceTransformer

Modifier and Type	Class and Description
class	ObservationTable<I,O> Observation table class.

Uses of AccessSequenceTransformer in de.learnlib.counterexamples

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

Modifier and Type	Method and Description
static <S,I,O> int	LocalSuffixFinders.findLinear(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> oracle) Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear ascending order.
static <I,O> List<Word<I>>	GlobalSuffixFinders.findLinear(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> 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,O> int	LocalSuffixFinders.findLinearReverse(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> oracle) Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in linear descending order.
static <I,O> List<Word<I>>	GlobalSuffixFinders.findLinearReverse(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> 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,O> int	LocalSuffixFinders.findRivestSchapire(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> 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,O> List<Word<I>>	GlobalSuffixFinders.findRivestSchapire(Query<I,O> ceQuery, AccessSequenceTransformer<I> asTransformer, SuffixOutput<I,O> hypOutput, MembershipOracle<I,O> 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,O> List<Word<I>>	GlobalSuffixFinders.findShahbaz(Query<I,O> 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,RO extends O> List<Word<RI>>	GlobalSuffixFinder.findSuffixes(Query<RI,RO> ceQuery, AccessSequenceTransformer<RI> asTransformer, SuffixOutput<RI,RO> hypOutput, MembershipOracle<RI,RO> oracle) Finds a set of distinguishing suffixes which will allow to expose at least one additional state in the hypothesis.
<RI extends I,RO extends O> int	LocalSuffixFinder.findSuffixIndex(Query<RI,RO> ceQuery, AccessSequenceTransformer<RI> asTransformer, SuffixOutput<RI,RO> hypOutput, MembershipOracle<RI,RO> 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.