Modifier and Type | Class and Description |
---|---|
class |
ADTHypothesis<I,O>
Hypothesis model.
|
Modifier and Type | Class and Description |
---|---|
class |
MealyDHC<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
DTLearnerHypothesis<I,O,SP,TP>
Basic hypothesis data structure for Discrimination Tree learning algorithms.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,D> int |
LocalSuffixFinders.findLinear(Query<I,D> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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.words.Word<I>> |
GlobalSuffixFinders.findLinear(Query<I,D> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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.findLinearReverse(Query<I,D> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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.words.Word<I>> |
GlobalSuffixFinders.findLinearReverse(Query<I,D> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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.findRivestSchapire(Query<I,D> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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,O> List<net.automatalib.words.Word<I>> |
GlobalSuffixFinders.findRivestSchapire(Query<I,O> ceQuery,
AccessSequenceTransformer<I> asTransformer,
net.automatalib.automata.concepts.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,D> List<net.automatalib.words.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> |
GlobalSuffixFinder.findSuffixes(Query<RI,RD> ceQuery,
AccessSequenceTransformer<RI> asTransformer,
net.automatalib.automata.concepts.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.automata.concepts.SuffixOutput<RI,RO> hypOutput,
MembershipOracle<RI,RO> oracle) |
<RI extends I,RD extends D> |
LocalSuffixFinder.findSuffixIndex(Query<RI,RD> ceQuery,
AccessSequenceTransformer<RI> asTransformer,
net.automatalib.automata.concepts.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.
|
<RI,RO> int |
AcexLocalSuffixFinder.findSuffixIndex(Query<RI,RO> ceQuery,
AccessSequenceTransformer<RI> asTransformer,
net.automatalib.automata.concepts.SuffixOutput<RI,RO> hypOutput,
MembershipOracle<RI,RO> oracle) |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableObservationTable<I,D> |
interface |
ObservationTable<I,D>
An observation table is a common method for learning algorithms to store organize their observations.
|
Modifier and Type | Class and Description |
---|---|
class |
GenericObservationTable<I,D>
Observation table class.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleObservationTable<I,D>
This class represents the data structure of an
ObservationTable without providing any meaningful
functionality. |
Copyright © 2018. All rights reserved.