Uses of Class
net.automatalib.word.Word

Packages that use Word

Package	Description
net.automatalib.alphabet	This package contains the basic concepts concerning alphabets.
net.automatalib.automaton.procedural
net.automatalib.automaton.procedural.impl	Implementations for net.automatalib.automaton.procedural.
net.automatalib.automaton.transducer
net.automatalib.incremental
net.automatalib.incremental.dfa
net.automatalib.incremental.dfa.dag
net.automatalib.incremental.dfa.tree
net.automatalib.incremental.mealy
net.automatalib.incremental.mealy.dag
net.automatalib.incremental.mealy.tree
net.automatalib.incremental.moore
net.automatalib.incremental.moore.dag
net.automatalib.incremental.moore.tree
net.automatalib.modelchecker.m3c.solver
net.automatalib.modelchecking
net.automatalib.modelchecking.impl	Implementations for net.automatalib.modelchecking.
net.automatalib.serialization.fsm.parser
net.automatalib.util.automaton
net.automatalib.util.automaton.ads
net.automatalib.util.automaton.builder
net.automatalib.util.automaton.conformance
net.automatalib.util.automaton.cover
net.automatalib.util.automaton.equivalence
net.automatalib.util.automaton.procedural
net.automatalib.util.automaton.vpa
net.automatalib.word	This package contains the basic concepts concerning words.

Uses of Word in net.automatalib.alphabet

Methods in net.automatalib.alphabet that return Word

Modifier and Type	Method	Description
default Word<I>	ProceduralInputAlphabet.expand(Iterable<I> input, Mapping<I,Word<I>> terminatingSequences)	Replaces all occurrences of call symbols in input with an embedded terminating sequence provided by terminatingSequences.
default Word<I>	VPAlphabet.longestWellMatchedPrefix(Word<I> word)	Return the longest well-matched (relative to this alphabet) prefix of the given word.
default Word<I>	VPAlphabet.longestWellMatchedSuffix(Word<I> word)	Return the longest well-matched (relative to this alphabet) suffix of the given word.
default Word<I>	ProceduralInputAlphabet.project(Word<I> input, int idx)	Replaces all well-matched occurrences of procedural invocations in input with the single respective call symbol.

Methods in net.automatalib.alphabet that return types with arguments of type Word

Modifier and Type	Method	Description
default <O> Pair<Word<I>,Word<O>>	ProceduralInputAlphabet.project(Word<I> input, Word<O> output, int idx)	A generalization of ProceduralInputAlphabet.project(Word, int) which applies the transformation to the input word as well as an output word (in a symbol-wise fashion).
default <O> Pair<Word<I>,Word<O>>	ProceduralInputAlphabet.project(Word<I> input, Word<O> output, int idx)	A generalization of ProceduralInputAlphabet.project(Word, int) which applies the transformation to the input word as well as an output word (in a symbol-wise fashion).

Methods in net.automatalib.alphabet with parameters of type Word

Modifier and Type	Method	Description
default int	VPAlphabet.callReturnBalance(Word<I> word)	Returns the call-return balance of the given word relative to this alphabet.
default int	ProceduralInputAlphabet.findCallIndex(Word<I> input, int idx)	Convenience method for ProceduralInputAlphabet.findCallIndex(List, int) that transforms the given input word into a list.
default int	ProceduralInputAlphabet.findReturnIndex(Word<I> input, int idx)	Convenience method for ProceduralInputAlphabet.findReturnIndex(List, int) that transforms the given input word into a list.
default boolean	VPAlphabet.isCallMatched(Word<I> word)	Returns whether the given word is call-matched relative to this alphabet.
default boolean	VPAlphabet.isReturnMatched(Word<I> word)	Returns whether the given word is return-matched relative to this alphabet.
default boolean	VPAlphabet.isWellMatched(Word<I> word)	Returns whether the given word is well-matched relative to this alphabet.
default Word<I>	VPAlphabet.longestWellMatchedPrefix(Word<I> word)	Return the longest well-matched (relative to this alphabet) prefix of the given word.
default Word<I>	VPAlphabet.longestWellMatchedSuffix(Word<I> word)	Return the longest well-matched (relative to this alphabet) suffix of the given word.
default Word<I>	ProceduralInputAlphabet.project(Word<I> input, int idx)	Replaces all well-matched occurrences of procedural invocations in input with the single respective call symbol.
default <O> Pair<Word<I>,Word<O>>	ProceduralInputAlphabet.project(Word<I> input, Word<O> output, int idx)	A generalization of ProceduralInputAlphabet.project(Word, int) which applies the transformation to the input word as well as an output word (in a symbol-wise fashion).

Method parameters in net.automatalib.alphabet with type arguments of type Word

Modifier and Type	Method	Description
default Word<I>	ProceduralInputAlphabet.expand(Iterable<I> input, Mapping<I,Word<I>> terminatingSequences)	Replaces all occurrences of call symbols in input with an embedded terminating sequence provided by terminatingSequences.

Uses of Word in net.automatalib.automaton.procedural

Methods in net.automatalib.automaton.procedural that return Word

Modifier and Type	Method	Description
default Word<O>	SPMM.computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix)

Uses of Word in net.automatalib.automaton.procedural.impl

Methods in net.automatalib.automaton.procedural.impl that return Word

Modifier and Type	Method	Description
Word<O>	EmptySPMM.computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix)

Uses of Word in net.automatalib.automaton.transducer

Methods in net.automatalib.automaton.transducer that return Word

Modifier and Type	Method	Description
default Word<O>	StateOutputAutomaton.computeStateOutput(S state, Iterable<? extends I> input)
default Word<O>	SubsequentialTransducer.computeStateOutput(S state, Iterable<? extends I> input)
default Word<O>	TransitionOutputAutomaton.computeStateOutput(S state, Iterable<? extends I> input)

Methods in net.automatalib.automaton.transducer that return types with arguments of type Word

Modifier and Type	Method	Description
default UniversalGraph<S,TransitionEdge<I,T>,Word<O>,TransitionEdge.Property<I,Word<O>>>	SubsequentialTransducer.transitionGraphView(Collection<? extends I> inputs)
default UniversalGraph<S,TransitionEdge<I,T>,Word<O>,TransitionEdge.Property<I,Word<O>>>	SubsequentialTransducer.transitionGraphView(Collection<? extends I> inputs)

Uses of Word in net.automatalib.incremental

Methods in net.automatalib.incremental that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	IncrementalConstruction.findSeparatingWord(A target, Collection<? extends I> inputs, boolean omitUndefined)	Checks the current state of the construction against a given target model, and returns a word exposing a difference if there is one.

Methods in net.automatalib.incremental with parameters of type Word

Modifier and Type	Method	Description
boolean	IncrementalConstruction.hasDefinitiveInformation(Word<? extends I> word)	Checks whether this class has definitive information about a given word.

Uses of Word in net.automatalib.incremental.dfa

Methods in net.automatalib.incremental.dfa with parameters of type Word

Modifier and Type	Method	Description
default boolean	IncrementalDFABuilder.hasDefinitiveInformation(Word<? extends I> word)
default void	IncrementalDFABuilder.insert(Word<? extends I> word)	Inserts a new word into the automaton.
void	IncrementalDFABuilder.insert(Word<? extends I> word, boolean accepting)	Inserts a new word into the automaton, with a given acceptance value.
Acceptance	IncrementalDFABuilder.lookup(Word<? extends I> inputWord)	Looks up the tri-state acceptance value for a given word.

Uses of Word in net.automatalib.incremental.dfa.dag

Methods in net.automatalib.incremental.dfa.dag with parameters of type Word

Modifier and Type	Method	Description
void	IncrementalDFADAGBuilder.insert(Word<? extends I> word, boolean accepting)	Inserts a word into either the set of accepted or rejected words.
void	IncrementalPCDFADAGBuilder.insert(Word<? extends I> word, boolean accepting)
Acceptance	IncrementalDFADAGBuilder.lookup(Word<? extends I> word)	Checks the ternary acceptance status for a given word.
Acceptance	IncrementalPCDFADAGBuilder.lookup(Word<? extends I> word)

Uses of Word in net.automatalib.incremental.dfa.tree

Methods in net.automatalib.incremental.dfa.tree that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	IncrementalDFATreeBuilder.findSeparatingWord(DFA<?,I> target, Collection<? extends I> inputs, boolean omitUndefined)

Methods in net.automatalib.incremental.dfa.tree with parameters of type Word

Modifier and Type	Method	Description
void	IncrementalDFATreeBuilder.insert(Word<? extends I> word, boolean acceptance)
void	IncrementalPCDFATreeBuilder.insert(Word<? extends I> word, boolean acceptance)
Acceptance	IncrementalDFATreeBuilder.lookup(Word<? extends I> inputWord)
Acceptance	IncrementalPCDFATreeBuilder.lookup(Word<? extends I> inputWord)

Uses of Word in net.automatalib.incremental.mealy

Methods in net.automatalib.incremental.mealy that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	AdaptiveMealyBuilder.getOldestInput()	Returns the oldest, non-overridden input that has been introduced and persisted.
default Word<O>	MealyBuilder.lookup(Word<? extends I> inputWord)

Methods in net.automatalib.incremental.mealy with parameters of type Word

Modifier and Type	Method	Description
default boolean	MealyBuilder.hasDefinitiveInformation(Word<? extends I> word)
boolean	AdaptiveMealyBuilder.insert(Word<? extends I> inputWord, Word<? extends O> outputWord)	Incorporates a pair of input/output words into the stored information.
void	IncrementalMealyBuilder.insert(Word<? extends I> inputWord, Word<? extends O> outputWord)	Incorporates a pair of input/output words into the stored information.
default Word<O>	MealyBuilder.lookup(Word<? extends I> inputWord)
boolean	MealyBuilder.lookup(Word<? extends I> inputWord, List<? super O> output)	Retrieves the output word for the given input word.

Uses of Word in net.automatalib.incremental.mealy.dag

Methods in net.automatalib.incremental.mealy.dag that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	IncrementalMealyDAGBuilder.findSeparatingWord(MealyMachine<?,I,?,O> target, Collection<? extends I> inputs, boolean omitUndefined)

Methods in net.automatalib.incremental.mealy.dag with parameters of type Word

Modifier and Type	Method	Description
boolean	IncrementalMealyDAGBuilder.hasDefinitiveInformation(Word<? extends I> word)
void	IncrementalMealyDAGBuilder.insert(Word<? extends I> word, Word<? extends O> outputWord)
boolean	IncrementalMealyDAGBuilder.lookup(Word<? extends I> word, List<? super O> output)

Uses of Word in net.automatalib.incremental.mealy.tree

Methods in net.automatalib.incremental.mealy.tree that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	AdaptiveMealyTreeBuilder.getOldestInput()

Methods in net.automatalib.incremental.mealy.tree with parameters of type Word

Modifier and Type	Method	Description
boolean	AdaptiveMealyTreeBuilder.insert(Word<? extends I> input, Word<? extends O> outputWord)
void	DynamicIncrementalMealyTreeBuilder.insert(Word<? extends I> input, Word<? extends O> outputWord)
void	IncrementalMealyTreeBuilder.insert(Word<? extends I> input, Word<? extends O> outputWord)

Uses of Word in net.automatalib.incremental.moore

Methods in net.automatalib.incremental.moore that return Word

Modifier and Type	Method	Description
default Word<O>	IncrementalMooreBuilder.lookup(Word<? extends I> inputWord)

Methods in net.automatalib.incremental.moore with parameters of type Word

Modifier and Type	Method	Description
default boolean	IncrementalMooreBuilder.hasDefinitiveInformation(Word<? extends I> word)
void	IncrementalMooreBuilder.insert(Word<? extends I> inputWord, Word<? extends O> outputWord)	Incorporates a pair of input/output words into the stored information.
default Word<O>	IncrementalMooreBuilder.lookup(Word<? extends I> inputWord)
boolean	IncrementalMooreBuilder.lookup(Word<? extends I> inputWord, List<? super O> output)	Retrieves the output word for the given input word.

Uses of Word in net.automatalib.incremental.moore.dag

Methods in net.automatalib.incremental.moore.dag that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	IncrementalMooreDAGBuilder.findSeparatingWord(MooreMachine<?,I,?,O> target, Collection<? extends I> inputs, boolean omitUndefined)

Methods in net.automatalib.incremental.moore.dag with parameters of type Word

Modifier and Type	Method	Description
boolean	IncrementalMooreDAGBuilder.hasDefinitiveInformation(Word<? extends I> word)
void	IncrementalMooreDAGBuilder.insert(Word<? extends I> word, Word<? extends O> outputWord)
boolean	IncrementalMooreDAGBuilder.lookup(Word<? extends I> word, List<? super O> output)

Uses of Word in net.automatalib.incremental.moore.tree

Methods in net.automatalib.incremental.moore.tree that return Word

Modifier and Type	Method	Description
@Nullable Word<I>	IncrementalMooreTreeBuilder.findSeparatingWord(MooreMachine<?,I,?,O> target, Collection<? extends I> inputs, boolean omitUndefined)

Methods in net.automatalib.incremental.moore.tree with parameters of type Word

Modifier and Type	Method	Description
void	IncrementalMooreTreeBuilder.insert(Word<? extends I> word, Word<? extends O> output)
boolean	IncrementalMooreTreeBuilder.lookup(Word<? extends I> inputWord, List<? super O> output)

Uses of Word in net.automatalib.modelchecker.m3c.solver

Methods in net.automatalib.modelchecker.m3c.solver that return Word

Modifier and Type	Method	Description
Word<L>	WitnessTree.getWitness()

Uses of Word in net.automatalib.modelchecking

Methods in net.automatalib.modelchecking that return Word

Modifier and Type	Method	Description
Word<I>	Lasso.getLoop()	Gets the loop of the lasso.
Word<I>	Lasso.getPrefix()	Gets the prefix of the lasso.
Word<I>	Lasso.getWord()	Gets the finite representation of the lasso.

Uses of Word in net.automatalib.modelchecking.impl

Methods in net.automatalib.modelchecking.impl that return Word

Modifier and Type	Method	Description
Word<O>	MealyLassoImpl.computeOutput(Iterable<? extends I> input)
Word<I>	AbstractLasso.getLoop()
Word<I>	AbstractLasso.getPrefix()
Word<I>	AbstractLasso.getWord()

Constructor parameters in net.automatalib.modelchecking.impl with type arguments of type Word

Constructor	Description
MealyLassoImpl(DetOutputAutomaton<?,I,?,Word<O>> automaton, Collection<? extends I> inputs, int unfoldTimes)

Uses of Word in net.automatalib.serialization.fsm.parser

Method parameters in net.automatalib.serialization.fsm.parser with type arguments of type Word

Modifier and Type	Method	Description
static <E> ModelDeserializer<CompactMealy<E,E>>	FSM2MealyParserAlternating.getParser(@Nullable Collection<? extends E> targetInputs, @Nullable Output<E,Word<E>> output, Function<String,E> edgeParser)	Constructs a ModelDeserializer that reads a MealyMachine description and writes it into a CompactMealy.
static <I,O> ModelDeserializer<CompactMealy<I,O>>	FSM2MealyParserAlternating.getParser(@Nullable Collection<? extends I> targetInputs, @Nullable Output<I,Word<O>> output, Function<String,I> inputParser, Function<String,O> outputParser)	Constructs a ModelDeserializer that reads a MealyMachine description and writes it into a CompactMealy.
static <I,O,A extends MutableMealyMachine<Integer,I,?,O>> ModelDeserializer<A>	FSM2MealyParserAlternating.getParser(@Nullable Collection<? extends I> targetInputs, @Nullable Output<I,Word<O>> output, Function<String,I> inputParser, Function<String,O> outputParser, AutomatonCreator<A,I> creator)	Constructs a ModelDeserializer that reads a MealyMachine description and writes it into a given MutableMealyMachine.

Uses of Word in net.automatalib.util.automaton

Methods in net.automatalib.util.automaton that return Word

Modifier and Type	Method	Description
static <I> @Nullable Word<I>	Automata.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)	Finds a separating word for two automata.
static <S,I> @Nullable Word<I>	Automata.findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, S state1, S state2, Collection<? extends I> inputs)	Finds a separating word for two states in an automaton.
static <I> @Nullable Word<I>	Automata.findShortestSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)	Finds a shortest separating word for two automata.

Methods in net.automatalib.util.automaton that return types with arguments of type Word

Modifier and Type	Method	Description
static <I> List<Word<I>>	Automata.characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)	Computes a characterizing set, and returns it as a List.
static <S,I> List<Word<I>>	Automata.stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state)	Computes a characterizing set for a single state, and returns it as a List.
static <I> List<Word<I>>	Automata.stateCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)	Convenient method for computing a state cover.
static <I> List<Word<I>>	Automata.structuralCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)	Convenient method for computing a structural cover.
static <I> List<Word<I>>	Automata.transitionCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)	Convenient method for computing a state cover.

Uses of Word in net.automatalib.util.automaton.ads

Methods in net.automatalib.util.automaton.ads that return types with arguments of type Word

Modifier and Type	Method	Description
static <S,I,O> Pair<Word<I>,Word<O>>	ADSUtil.buildTraceForNode(ADSNode<S,I,O> node)
static <S,I,O> Pair<Word<I>,Word<O>>	ADSUtil.buildTraceForNode(ADSNode<S,I,O> node)
static <S,I,O,N extends RecursiveADSNode<S,I,O,N>> Pair<Word<I>,Word<O>>	ADSUtil.buildTraceForNode(N node, Predicate<N> predicate)
static <S,I,O,N extends RecursiveADSNode<S,I,O,N>> Pair<Word<I>,Word<O>>	ADSUtil.buildTraceForNode(N node, Predicate<N> predicate)

Methods in net.automatalib.util.automaton.ads with parameters of type Word

Modifier and Type	Method	Description
static <S,I,T,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>>	ADSUtil.buildFromTrace(MealyMachine<S,I,T,O> automaton, Word<I> trace, S state)
static <S,I,T,O,N extends RecursiveADSNode<S,I,O,N>> Pair<N,N>	ADSUtil.buildFromTrace(MealyMachine<S,I,T,O> automaton, Word<I> trace, S state, BiFunction<@Nullable N,I,N> creator)

Uses of Word in net.automatalib.util.automaton.builder

Methods in net.automatalib.util.automaton.builder that return types with arguments of type Word

Modifier and Type	Method	Description
static <S,I,T,O,A extends MutableSubsequentialTransducer<S,? super I,T,? super O>> AutomatonBuilder<S,I,T,Word<O>,Word<O>,A>	AutomatonBuilders.forSST(A sst)
static <S,I,T,O,A extends MutableSubsequentialTransducer<S,? super I,T,? super O>> AutomatonBuilder<S,I,T,Word<O>,Word<O>,A>	AutomatonBuilders.forSST(A sst)
static <I,O> AutomatonBuilder<Integer,I,CompactTransition<Word<O>>,Word<O>,Word<O>,CompactSST<I,O>>	AutomatonBuilders.newSST(Alphabet<I> alphabet)
static <I,O> AutomatonBuilder<Integer,I,CompactTransition<Word<O>>,Word<O>,Word<O>,CompactSST<I,O>>	AutomatonBuilders.newSST(Alphabet<I> alphabet)
static <I,O> AutomatonBuilder<Integer,I,CompactTransition<Word<O>>,Word<O>,Word<O>,CompactSST<I,O>>	AutomatonBuilders.newSST(Alphabet<I> alphabet)

Uses of Word in net.automatalib.util.automaton.conformance

Methods in net.automatalib.util.automaton.conformance that return Word

Modifier and Type	Method	Description
protected Word<I>	SPATestsIterator.combine(I callSymbol, Word<I> testSequence)
protected Word<I>	WMethodTestsIterator.combine(Word<I> prefix, List<I> middle, Word<I> suffix)
Word<I>	IncrementalWMethodTestsIterator.next()
Word<I>	WpMethodTestsIterator.next()

Methods in net.automatalib.util.automaton.conformance that return types with arguments of type Word

Modifier and Type	Method	Description
protected Iterator<Word<I>>	SPATestsIterator.l2Iterator(I callSymbol)
protected Iterator<Word<I>>	WMethodTestsIterator.l3Iterator(Word<I> prefix, List<I> middle)

Methods in net.automatalib.util.automaton.conformance with parameters of type Word

Modifier and Type	Method	Description
protected Word<I>	SPATestsIterator.combine(I callSymbol, Word<I> testSequence)
protected Word<I>	WMethodTestsIterator.combine(Word<I> prefix, List<I> middle, Word<I> suffix)
protected Iterator<List<I>>	WMethodTestsIterator.l2Iterator(Word<I> l1Object)
protected Iterator<Word<I>>	WMethodTestsIterator.l3Iterator(Word<I> prefix, List<I> middle)

Constructor parameters in net.automatalib.util.automaton.conformance with type arguments of type Word

Constructor	Description
SPATestsIterator(SPA<?,I> spa, BiFunction<DFA<?,I>,Collection<I>,Iterator<Word<I>>> conformanceTestProvider)
SPATestsIterator(SPA<?,I> spa, ProceduralInputAlphabet<I> alphabet, BiFunction<DFA<?,I>,Collection<I>,Iterator<Word<I>>> conformanceTestProvider)

Uses of Word in net.automatalib.util.automaton.cover

Methods in net.automatalib.util.automaton.cover that return types with arguments of type Word

Modifier and Type	Method	Description
static <I> Iterator<Word<I>>	Covers.incrementalStateCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> stateCover)	Returns an iterator for the remaining sequences of a state cover.
static <I> Iterator<Word<I>>	Covers.incrementalTransitionCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> transitionCover)	Returns an iterator for the remaining sequences of a transition cover.
static <I> Iterator<Word<I>>	Covers.stateCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)	Returns an iterator for the sequences of a state cover.
static <I> Iterator<Word<I>>	Covers.transitionCoverIterator(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)	Returns an iterator for the sequences of a transition cover.

Uses of Word in net.automatalib.util.automaton.equivalence

Methods in net.automatalib.util.automaton.equivalence that return Word

Modifier and Type	Method	Description
static <I,S,T,SP,TP,S2,T2,SP2,TP2> @Nullable Word<I>	DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> reference, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs)
static <I> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
static <I> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Alphabet<I> inputs)
static <S,I> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> target, S init1, S init2, Collection<? extends I> inputs)
static <S,I,T> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)	Find a separating word for two states in a given automaton.
static <S,S2,I,T,T2,SP,SP2,TP,TP2> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
static <S,S2,I,T,T2,SP,SP2,TP,TP2> @Nullable Word<I>	NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Alphabet<I> inputs, boolean ignoreUndefinedTransitions)

Methods in net.automatalib.util.automaton.equivalence that return types with arguments of type Word

Modifier and Type	Method	Description
static <I> Iterator<Word<I>>	CharacterizingSets.characterizingSetIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
static <I> Iterator<Word<I>>	CharacterizingSets.incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes)

Uses of Word in net.automatalib.util.automaton.procedural

Fields in net.automatalib.util.automaton.procedural with type parameters of type Word

Modifier and Type	Field	Description
Map<I,Word<I>>	ATRSequences.accessSequences
Map<I,Word<I>>	ATSequences.accessSequences
Map<I,Word<I>>	ATRSequences.returnSequences
Map<I,Word<I>>	ATRSequences.terminatingSequences
Map<I,Word<I>>	ATSequences.terminatingSequences

Methods in net.automatalib.util.automaton.procedural that return Word

Modifier and Type	Method	Description
static <I> @Nullable Word<I>	SBAs.findSeparatingWord(SBA<?,I> sba1, SBA<?,I> sba2, ProceduralInputAlphabet<I> alphabet)	Computes a separating word for the two given SBAs, if existent.
static <I> @Nullable Word<I>	SPAs.findSeparatingWord(SPA<?,I> spa1, SPA<?,I> spa2, ProceduralInputAlphabet<I> alphabet)	Computes a separating word for the two given SPAs, if existent.
static <I,O> @Nullable Word<I>	SPMMs.findSeparatingWord(SPMM<?,I,?,O> spmm1, SPMM<?,I,?,O> spmm2, ProceduralInputAlphabet<I> alphabet)	Computes a separating word for the two given SPMMs, if existent.

Methods in net.automatalib.util.automaton.procedural that return types with arguments of type Word

Modifier and Type	Method	Description
static <I> Pair<Map<I,Word<I>>,Map<I,Word<I>>>	SPAs.computeAccessAndReturnSequences(SPA<?,I> spa, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPA a set of access sequences and return sequences using the given alphabet.
static <I> Pair<Map<I,Word<I>>,Map<I,Word<I>>>	SPAs.computeAccessAndReturnSequences(SPA<?,I> spa, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPA a set of access sequences and return sequences using the given alphabet.
static <I> Map<I,Word<I>>	SBAs.computeAccessSequences(SBA<?,I> sba, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SBA a set of access sequences using the given alphabet.
static <I,O> Map<I,Word<I>>	SPMMs.computeAccessSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPMM a set of access sequences using the SPMM alphabet.
static <I> Map<I,Word<I>>	SBAs.computeTerminatingSequences(SBA<?,I> sba, ProceduralInputAlphabet<I> alphabet)	Computes for a given SBA a set of terminating sequences using the given alphabet.
static <I> Map<I,Word<I>>	SPAs.computeTerminatingSequences(SPA<?,I> spa, ProceduralInputAlphabet<I> alphabet)	Computes for a given SPA a set of terminating sequences using the given alphabet.
static <I,O> Map<I,Word<I>>	SPMMs.computeTerminatingSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet)	Computes for a given SPMM the set of terminating sequences using the given alphabet.

Method parameters in net.automatalib.util.automaton.procedural with type arguments of type Word

Modifier and Type	Method	Description
static <I> Pair<Map<I,Word<I>>,Map<I,Word<I>>>	SPAs.computeAccessAndReturnSequences(SPA<?,I> spa, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPA a set of access sequences and return sequences using the given alphabet.
static <I> Map<I,Word<I>>	SBAs.computeAccessSequences(SBA<?,I> sba, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SBA a set of access sequences using the given alphabet.
static <I,O> Map<I,Word<I>>	SPMMs.computeAccessSequences(SPMM<?,I,?,O> spmm, ProceduralInputAlphabet<I> alphabet, Map<I,Word<I>> terminatingSequences)	Computes for a given SPMM a set of access sequences using the SPMM alphabet.

Constructor parameters in net.automatalib.util.automaton.procedural with type arguments of type Word

Constructor	Description
ATRSequences(Map<I,Word<I>> accessSequences, Map<I,Word<I>> terminatingSequences, Map<I,Word<I>> returnSequences)
ATSequences(Map<I,Word<I>> accessSequences, Map<I,Word<I>> terminatingSequences)

Uses of Word in net.automatalib.util.automaton.vpa

Methods in net.automatalib.util.automaton.vpa that return Word

Modifier and Type	Method	Description
static <L,I> @Nullable Word<I>	OneSEVPAs.computeAccessSequence(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet, Predicate<? super L> predicate)	Computes an access sequence over the given alphabet (if existent) such that it reaches a location of the given SEVPA that satisfies the given predicate.
static <L,I> @Nullable Word<I>	OneSEVPAs.findAcceptedWord(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet)	Returns a well-matched word (over the given alphabet) that is accepted by the given SEVPA, if existent.
static <L,I> @Nullable Word<I>	OneSEVPAs.findRejectedWord(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet)	Returns a well-matched word (over the given alphabet) that is rejected by the given SEVPA, if existent.
static <I> @Nullable Word<I>	OneSEVPAs.findSeparatingWord(OneSEVPA<?,I> sevpa1, OneSEVPA<?,I> sevpa2, VPAlphabet<I> alphabet)	Finds a separating word for two SEVPAs, if existent.

Methods in net.automatalib.util.automaton.vpa that return types with arguments of type Word

Modifier and Type	Method	Description
static <L,I> ArrayStorage<Word<I>>	OneSEVPAs.computeAccessSequences(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet)	Computes all access sequences over the given alphabet (if existent) to the locations of the given SEVPA.
static <L,I> Collection<Pair<Word<I>,Word<I>>>	OneSEVPAs.findCharacterizingSet(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet)	Computes a characterizing set for the given SEVPA.
static <L,I> Collection<Pair<Word<I>,Word<I>>>	OneSEVPAs.findCharacterizingSet(OneSEVPA<L,I> sevpa, VPAlphabet<I> alphabet)	Computes a characterizing set for the given SEVPA.
static <L,I> @Nullable Pair<Word<I>,Word<I>>	OneSEVPAs.findSeparatingWord(OneSEVPA<L,I> sevpa, L init1, L init2, VPAlphabet<I> alphabet)	Finds a separating word for two locations of a SEVPAs, if existent.
static <L,I> @Nullable Pair<Word<I>,Word<I>>	OneSEVPAs.findSeparatingWord(OneSEVPA<L,I> sevpa, L init1, L init2, VPAlphabet<I> alphabet)	Finds a separating word for two locations of a SEVPAs, if existent.

Uses of Word in net.automatalib.word

Methods in net.automatalib.word that return Word

Modifier and Type	Method	Description
Word<I>	Word.append(I symbol)	Appends a symbol to this word and returns the result as a new word.
Word<I>	Word.canonicalNext(Alphabet<I> sigma)	Retrieves the next word after this in canonical order.
Word<I>	Word.concat(Word<? extends I>... words)	Concatenates this word with several other words and returns the result as a new word.
protected Word<I>	Word.concatInternal(Word<? extends I>... words)	Realizes the concatenation of this word with several other words.
static <I> Word<I>	Word.epsilon()	Retrieves the empty word.
Word<I>	Word.flatten()	Retrieves a "flattened" version of this word, i.e., without any hierarchical structure attached.
static <I> Word<I>	Word.fromArray(I[] symbols, int offset, int length)	Creates a word from a subrange of an array of symbols.
static Word<Character>	Word.fromCharSequence(CharSequence cs)
static <I> Word<I>	Word.fromLetter(I letter)	Constructs a word from a single letter.
static <I> Word<I>	Word.fromList(List<? extends I> symbolList)	Creates a word from a list of symbols.
static Word<Character>	Word.fromString(String str)
static <I> Word<I>	Word.fromSymbols(I... symbols)	Creates a word from an array of symbols.
static <I> Word<I>	Word.fromWords(Collection<? extends Word<? extends I>> words)
static <I> Word<I>	Word.fromWords(Word<? extends I>... words)
Word<I>	Word.longestCommonPrefix(Word<?> other)	Determines the longest common prefix of this word and another word.
Word<I>	Word.longestCommonSuffix(Word<?> other)	Determines the longest common suffix of this word and another word.
Word<I>	Word.prefix(int prefixLen)	Retrieves a prefix of the given length.
Word<I>	Word.prepend(I symbol)	Prepends a symbol to this word and returns the result as a new word.
Word<I>	Word.subWord(int fromIndex)	Retrieves the subword of this word starting at the given index and extending until the end of this word.
Word<I>	Word.subWord(int fromIndex, int toIndex)	Retrieves a word representing the specified subrange of this word.
protected Word<I>	Word.subWordInternal(int fromIndex, int toIndex)	Internal subword operation implementation.
Word<I>	Word.suffix(int suffixLen)	Retrieves a suffix of the given length.
Word<I>	WordBuilder.toWord()	Creates a word from the contents of the internal storage.
Word<I>	WordBuilder.toWord(int fromIndex, int toIndex)	Creates a word from the given range of the contents of the internal storage.
<T> Word<T>	Word.transform(Function<? super I,? extends T> transformer)	Transforms a word symbol-by-symbol, using the specified transformation function.
Word<I>	Word.trimmed()
static <I> Word<I>	Word.upcast(Word<? extends I> word)	Performs an upcast of the generic type parameter of the word.

Methods in net.automatalib.word that return types with arguments of type Word

Modifier and Type	Method	Description
static <I> Comparator<Word<I>>	Word.canonicalComparator(Comparator<? super I> symComparator)
static <I> Collector<I,?,Word<I>>	Word.collector()	Returns a Collector that collects individual symbols (in order) and aggregates them in a Word.
List<Word<I>>	Word.prefixes(boolean longestFirst)	Retrieves the list of all prefixes of this word.
List<Word<I>>	Word.suffixes(boolean longestFirst)	Retrieves the list of all suffixes of this word.

Methods in net.automatalib.word with parameters of type Word

Modifier and Type	Method	Description
WordBuilder<I>	WordBuilder.append(Word<? extends I> word)	Appends a word to the contents of the internal storage.
WordBuilder<I>	WordBuilder.append(Word<? extends I>... words)	Appends several words to the contents of the internal storage.
Word<I>	Word.concat(Word<? extends I>... words)	Concatenates this word with several other words and returns the result as a new word.
protected Word<I>	Word.concatInternal(Word<? extends I>... words)	Realizes the concatenation of this word with several other words.
static <I> Word<I>	Word.fromWords(Word<? extends I>... words)
boolean	Word.isPrefixOf(Word<?> other)	Checks if this word is a prefix of another word.
boolean	Word.isSuffixOf(Word<?> other)	Checks if this word is a suffix of another word.
Word<I>	Word.longestCommonPrefix(Word<?> other)	Determines the longest common prefix of this word and another word.
Word<I>	Word.longestCommonSuffix(Word<?> other)	Determines the longest common suffix of this word and another word.
WordBuilder<I>	WordBuilder.repeatAppend(int num, Word<I> word)	Appends num copies of the given word to the contents of the initial storage.
static <I> Word<I>	Word.upcast(Word<? extends I> word)	Performs an upcast of the generic type parameter of the word.

Method parameters in net.automatalib.word with type arguments of type Word

Modifier and Type	Method	Description
static <I> Word<I>	Word.fromWords(Collection<? extends Word<? extends I>> words)

Constructors in net.automatalib.word with parameters of type Word

Constructor	Description
WordBuilder(int capacity, Word<I> init)	Constructor.
WordBuilder(Word<I> init)	Constructor.