Index (AutomataLib :: Utilities 0.6.0 API)

A B C D E F G H I L M N O P R S T U V W X

A

AbstractLowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2,TS1 extends TransitionSystem<S1,? super I1,T1>> - Class in net.automatalib.util.automata.copy
AbstractLowLevelAutomatonCopier(TS1, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Constructor for class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
AbstractRandomAutomatonGenerator<S,I,T,SP,TP,A extends MutableAutomaton<S,I,T,SP,TP>> - Class in net.automatalib.util.automata.random
AbstractRandomAutomatonGenerator(Random, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Constructor for class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
acceptance(AcceptorTS<S, ?>) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
AcceptanceCombiner - Interface in net.automatalib.util.ts.acceptors
Acceptors - Class in net.automatalib.util.ts.acceptors
add(I, SuffixTrieNode) - Method in class net.automatalib.util.tries.SharedSuffixTrie
add(I, SuffixTrieNode) - Method in class net.automatalib.util.tries.SuffixTrie: Adds a word to the trie.
addStates(int) - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
addTransitions() - Method in class net.automatalib.util.automata.random.RandomDeterministicAutomatonGenerator
AGHelper - Class in net.automatalib.util.automata.asgraph
AGHelper() - Constructor for class net.automatalib.util.automata.asgraph.AGHelper
allDefinedInputs(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
allDefinedInputs(TransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
allDefinedInputsIterator(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
allDefinedInputsIterator(TransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
allUndefinedInputs(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
allUndefinedInputsIterator(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
allUndefinedTransitions(TransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
allUndefinedTransitionsIterator(TransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
alwaysFalse() - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
alwaysTrue() - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
and(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the conjunction ("and") of two DFA, and stores the result in a given mutable DFA.
and(DFA<?, I>, DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the conjunction ("and") of two DFA, and returns the result as a new DFA.
AND - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner
and(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
appendSuffix(SuffixTrieNode, List<? super I>) - Static method in class net.automatalib.util.tries.SuffixTrieNode
appendSuffix(List<? super I>) - Method in class net.automatalib.util.tries.SuffixTrieNode
asBlockAutomaton() - Method in class net.automatalib.util.minimizer.MinimizationResult: Creates a BlockAutomaton using this results structure.
asGraph(Automaton<S, I, T>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
asUniversalGraph(UniversalAutomaton<S, I, T, SP, TP>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
Automata - Class in net.automatalib.util.automata
Automata() - Constructor for class net.automatalib.util.automata.Automata
automaton - Variable in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
automaton - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
AutomatonAsGraph<S,I,T,A extends Automaton<S,I,T>> - Class in net.automatalib.util.automata.asgraph
AutomatonAsGraph(A, Collection<? extends I>) - Constructor for class net.automatalib.util.automata.asgraph.AutomatonAsGraph
AutomatonBuilders - Class in net.automatalib.util.automata.builders: Fluent interface automaton builders.
AutomatonCopyMethod - Interface in net.automatalib.util.automata.copy
AutomatonLowLevelCopy - Class in net.automatalib.util.automata.copy

B

backEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
backEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
backtrackEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
backtrackEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
backtrackEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
backtrackEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graphs.traversal.GraphTraversalVisitor
BaseDFSVisitor<N,E,D> - Class in net.automatalib.util.graphs.traversal: A base implementation of a DFSVisitor.
BaseDFSVisitor() - Constructor for class net.automatalib.util.graphs.traversal.BaseDFSVisitor
bfIterator(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
BFS - Static variable in interface net.automatalib.util.automata.copy.AutomatonCopyMethod
bfsOrder(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.TS
BFSOrderIterator<S,I> - Class in net.automatalib.util.ts.traversal
BFSOrderIterator(SimpleTS<S, I>, Collection<? extends I>) - Constructor for class net.automatalib.util.ts.traversal.BFSOrderIterator
bfsOrderIterator(TransitionSystem<S, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.ts.TS
blackTarget(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
Block<S,L> - Class in net.automatalib.util.minimizer: A block in the partition calculated during minimization.
Block - Class in net.automatalib.util.partitionrefinement: A block (i.e., partition class) that is maintained during the Paige/Tarjan partition refinement algorithm (see PaigeTarjan).
Block(int, int, int, Block) - Constructor for class net.automatalib.util.partitionrefinement.Block: Constructor.
BlockAutomaton<S,L> - Class in net.automatalib.util.minimizer: A "block automaton", i.e. an automaton-style representation of the minimization result in which each block forms a state.
blockData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The array storing the raw block data, i.e., the states contained in a certain block.
BlockEdge<S,L> - Class in net.automatalib.util.minimizer: An edge in a BlockAutomaton.
blockForState - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The array mapping states (in the range between 0 and PaigeTarjan.numStates) to their containing block.
blockList() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves an Iterable that provides the iterator returned by PaigeTarjan.blockListIterator().
blockListIterator() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves an iterator for iterating over all blocks in the block list.
BlockMap<V> - Class in net.automatalib.util.minimizer: Class for associating arbitrary values with the blocks of a minimization result.
BlockMap(MinimizationResult<?, ?>) - Constructor for class net.automatalib.util.minimizer.BlockMap: Constructor.
BREADTH_FIRST - Static variable in interface net.automatalib.util.ts.traversal.TSTraversalMethod
breadthFirst(IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
breadthFirst(IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
breadthFirst(IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
breadthFirst(IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
breadthFirst(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal: Traverses the given transition system in a breadth-first fashion.
breadthFirst(TransitionSystem<S, ? super I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
breadthFirstOrder(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal

C

characterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata: Computes a characterizing set for the given automaton.
characterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata: Computes a characterizing set, and returns it as a List.
CharacterizingSets - Class in net.automatalib.util.automata.equivalence: Operations for calculating characterizing sets.
CharacterizingSets() - Constructor for class net.automatalib.util.automata.equivalence.CharacterizingSets
checkUsable() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizBrowserVisualizationProvider
checkUsable() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizSwingVisualizationProvider
chooseInitial() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
chooseIntials(int) - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
Color - Enum in net.automatalib.util.traversal: Enum to use for coloring nodes/states during traversal.
combine(List, Word, Word) - Method in class net.automatalib.util.automata.conformance.WMethodTestsIterator
combine(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A, AcceptanceCombiner) - Static method in class net.automatalib.util.automata.fsa.DFAs: Most general way of combining two DFAs.
combine(DFA<?, I>, DFA<?, I>, Alphabet, AcceptanceCombiner) - Static method in class net.automatalib.util.automata.fsa.DFAs: Most general way of combining two DFAs.
combine(boolean, boolean) - Method in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner: Combine two acceptance values.
combine(TS1, TS2, AcceptanceCombiner) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
complement(DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the complement (negation) of a DFA, and stores the result in a given mutable DFA.
complement(DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the complement (negation) of a DFA, and returns the result as a new DFA.
complement(MutableDFA<S, I>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.fsa.MutableDFAs
complete(DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs
complete(DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs
complete(MutableDFA<S, I>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.fsa.MutableDFAs
complete(MutableDFA<S, I>, Collection<? extends I>, boolean) - Static method in class net.automatalib.util.automata.fsa.MutableDFAs
complete(MutableDFA<S, I>, Collection<? extends I>, boolean, boolean) - Static method in class net.automatalib.util.automata.fsa.MutableDFAs
compose(Predicate<? super S>, Predicate<? super I>, Predicate<? super T>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
computeCoarsestStablePartition() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Refines the partition until it stabilizes.
constantValue(boolean) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP1, ? extends TP1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP1, ? extends TP1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP, ? extends TP>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I1, T1, ? extends SP, ? extends TP>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP, ? extends TP>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton with compatible input alphabets and properties.
copy(AutomatonCopyMethod, UniversalAutomaton<S1, ? super I, T1, ? extends SP, ? extends TP>, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies a UniversalAutomaton with compatible input alphabets and properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP1, ? extends TP1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP2, ? super TP2>, Function<? super SP1, ? extends SP2>, Function<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly heterogeneous properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP, ? extends TP>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I1, T1, ? extends SP, ? extends TP>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP, ? super TP>, Function<? super I1, ? extends I2>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP, ? extends TP>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton with compatible input alphabets and properties.
copy(TSTraversalMethod, UniversalTransitionSystem<S1, ? super I, T1, ? extends SP, ? extends TP>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, ? super SP, ? super TP>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies a UniversalAutomaton with compatible input alphabets and properties.
copyInitialState(S1) - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
copyPlain(Graph<N1, E1>, MutableGraph<N2, E2, NP2, EP2>, Mapping<? super N1, ? extends NP2>, Mapping<? super E1, ? extends EP2>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
copyPlain(UniversalGraph<N1, E1, ? extends NP2, ? extends EP2>, MutableGraph<N2, E2, NP2, EP2>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
copyState(S1) - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
copyTransition(S2, I2, T1, S1) - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
copyTransitionChecked(S2, I2, T1, S1) - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
copyTransitions(S2, I2, Iterator<? extends T1>) - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
copyTraversal(IndefiniteGraph<N1, E1>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>, Mapping<? super N1, ? extends NP2>, Mapping<? super E1, ? extends EP2>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
copyTraversal(UniversalIndefiniteGraph<N1, E1, ? extends NP2, ? extends EP2>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
copyUniversalPlain(UniversalGraph<N1, E1, NP1, EP1>, MutableGraph<N2, E2, NP2, EP2>, Mapping<? super NP1, ? extends NP2>, Mapping<? super EP1, ? extends EP2>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
copyUniversalTraversal(UniversalIndefiniteGraph<N1, E1, NP1, EP1>, MutableGraph<N2, E2, NP2, EP2>, TraversalOrder, int, Collection<? extends N1>, Mapping<? super NP1, ? extends NP2>, Mapping<? super EP1, ? extends EP2>) - Static method in class net.automatalib.util.graphs.copy.GraphCopy
cover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? super Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata
createBlock() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Creates a new block.
createBlockForStateMap() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Creates the PaigeTarjan.blockForState mapping from the blocks in the block list, and the contents of the PaigeTarjan.blockData array.
createDynamicNodeMapping() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
createLowLevelCopier(Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Method in interface net.automatalib.util.automata.copy.AutomatonCopyMethod
createStaticNodeMapping() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
crossEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
crossEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor

D

data - Variable in class net.automatalib.util.ts.traversal.DFRecord
DEFAULT_GRAPH_REPRESENTABLE - Static variable in class net.automatalib.util.tries.SuffixTrie
DefaultGraphTraversalVisitor<N,E,D> - Class in net.automatalib.util.graphs.traversal
DefaultGraphTraversalVisitor() - Constructor for class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
definedInputs(DeterministicTransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
definedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Static method in class net.automatalib.util.ts.TS
depth(SuffixTrieNode) - Static method in class net.automatalib.util.tries.SuffixTrieNode
depth() - Method in class net.automatalib.util.tries.SuffixTrieNode
DEPTH_FIRST - Static variable in interface net.automatalib.util.ts.traversal.TSTraversalMethod
depthFirst(IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
depthFirst(IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
depthFirst(IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
depthFirst(IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
depthFirst(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
depthFirst(TransitionSystem<S, I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
depthFirstOrder(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
DetAcceptorComposition<S1,S2,I,A1 extends DeterministicAcceptorTS<S1,I>,A2 extends DeterministicAcceptorTS<S2,I>> - Class in net.automatalib.util.ts.acceptors
DetAcceptorComposition(A1, A2, AcceptanceCombiner) - Constructor for class net.automatalib.util.ts.acceptors.DetAcceptorComposition
DeterministicEquivalenceTest - Class in net.automatalib.util.automata.equivalence
DeterministicEquivalenceTest(UniversalDeterministicAutomaton<?, I, ?, ?, ?>) - Constructor for class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest
determinize(NFA<?, I>, Collection<? extends I>, MutableDFA<?, I>, boolean, boolean) - Static method in class net.automatalib.util.automata.fsa.NFAs
determinize(NFA<?, I>, Alphabet, boolean, boolean) - Static method in class net.automatalib.util.automata.fsa.NFAs
determinize(NFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.NFAs
determinize(A, boolean, boolean) - Static method in class net.automatalib.util.automata.fsa.NFAs
determinize(A) - Static method in class net.automatalib.util.automata.fsa.NFAs
determinize(NFA<?, I>, Collection<? extends I>, MutableDFA<?, I>) - Static method in class net.automatalib.util.automata.fsa.NFAs
DFAs - Class in net.automatalib.util.automata.fsa: Operations on DFAs.
dfIterator(IndefiniteGraph<N, E>, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
DFRecord<S,I,T,D> - Class in net.automatalib.util.ts.traversal
DFRecord(S, Collection<? extends I>, D) - Constructor for class net.automatalib.util.ts.traversal.DFRecord
DFS - Static variable in interface net.automatalib.util.automata.copy.AutomatonCopyMethod
dfs(IndefiniteGraph<N, E>, int, Collection<? extends N>, DFSVisitor<? super N, ? super E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
dfs(IndefiniteGraph<N, E>, N, DFSVisitor<? super N, ? super E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
dfs(IndefiniteGraph<N, E>, Collection<? extends N>, DFSVisitor<? super N, ? super E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
DFSVisitor<N,E,D> - Interface in net.automatalib.util.graphs.traversal
doCopy() - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
doCopy() - Method in interface net.automatalib.util.automata.copy.LowLevelAutomatonCopier

E

edge(N, D, E, N) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor: Most general edge handler.
edgeList() - Method in class net.automatalib.util.graphs.Path
edgeList - Variable in class net.automatalib.util.graphs.Path.PathData
edgeProperties(UniversalIndefiniteGraph<?, E, ?, EP>) - Static method in class net.automatalib.util.graphs.Graphs: Deprecated.
endNode() - Method in class net.automatalib.util.graphs.Path
equiv(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the equivalence ("<=>") of two DFA, and stores the result in a given mutable DFA.
equiv(DFA<?, I>, DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the equivalence ("<=>") of two DFA, and returns the result as a new DFA.
EQUIV - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner
equiv(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
explore(N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
explore(N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
extractMin() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue: Retrieves and removes the element at the head of the queue (i.e., the minimum element in the queue).

F

filterByOutput(MealyMachine<?, I, ?, O>, Alphabet, Predicate<? super O>) - Static method in class net.automatalib.util.automata.transout.MealyFilter
filterByOutput(MealyMachine<S1, I, T1, O>, Collection<? extends I>, MutableMealyMachine<S2, I, ?, O>, Predicate<? super O>) - Static method in class net.automatalib.util.automata.transout.MealyFilter
findCharacterizingSet(UniversalDeterministicAutomaton<S, I, T, ?, ?>, Collection<? extends I>, S, Collection<? super Word>) - Static method in class net.automatalib.util.automata.equivalence.CharacterizingSets: Computes a characterizing set for a specified state in the given automaton.
findCharacterizingSet(UniversalDeterministicAutomaton<S, I, T, ?, ?>, Collection<? extends I>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.equivalence.CharacterizingSets: Computes a characterizing set for the given automaton.
findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S, I, T, ?, ?>, Collection<? extends I>, Collection<? extends Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.equivalence.CharacterizingSets
findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata: Finds a separating word for two automata.
findSeparatingWord(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, S, S, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata: Finds a separating word for two states in an automaton.
findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Method in class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest
findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, ?, ?>, UniversalDeterministicAutomaton<S2, I, T2, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest
findSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Method in class net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest
findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, ?, ?>, UniversalDeterministicAutomaton<S2, I, T2, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest
findSeparatingWord(UniversalDeterministicAutomaton<S, I, T, ?, ?>, S, S, Collection<? extends I>) - Static method in class net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest
findSeparatingWordLarge(UniversalDeterministicAutomaton<S, I, T, ?, ?>, UniversalDeterministicAutomaton<S2, I, T2, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest
findShortestPath(IndefiniteGraph<N, E>, int, N, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.Graphs
findShortestPath(IndefiniteGraph<N, E>, int, N, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.Graphs
findShortestSeparatingWord(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
findUndefinedInput(Automaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
finish(N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
finish(N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
finishExploration(N, D) - Method in class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
finishExploration(N, D) - Method in interface net.automatalib.util.graphs.traversal.GraphTraversalVisitor: Called when the exploration of a node is finished.
firstEdge() - Method in class net.automatalib.util.graphs.Path
firstNode() - Method in class net.automatalib.util.graphs.Path
forDFA(A) - Static method in class net.automatalib.util.automata.builders.AutomatonBuilders
forDFA() - Static method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Creates a random IC automaton generator instance for generating DFAs.
forDFA(double) - Static method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Creates a random IC automaton generator instance for generating DFAs.
forMealy(A) - Static method in class net.automatalib.util.automata.builders.AutomatonBuilders
forwardEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
forwardEdge(N, D, E, N, D) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor

G

generateICDeterministicAutomaton(int, Collection<? extends I>, A, Random) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Generates an initially connected (IC) deterministic automaton with the given parameters.
generateICDeterministicAutomaton(int, Alphabet, AutomatonCreator<? extends A, I>, Random) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Generates an initially-connected (IC) deterministic automaton with the given parameters.
get(int) - Method in class net.automatalib.util.graphs.Path
get(Block<?, ?>) - Method in class net.automatalib.util.minimizer.BlockMap: Retrieves a value.
getAutomaton() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
getBlockForState(S) - Method in class net.automatalib.util.minimizer.MinimizationResult: Retrieves the block to which a given original state belongs.
getBlockForState(int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves the corresponding block for a given state (ID).
getBlocks() - Method in class net.automatalib.util.minimizer.MinimizationResult: Retrieves all blocks in the final partition.
getEdgeProperty(TransitionEdge<I, T>) - Method in class net.automatalib.util.automata.asgraph.UniversalAutomatonAsGraph
getEdgeWeight(E) - Method in class net.automatalib.util.graphs.concepts.PropertyEdgeWeights
getElement() - Method in class net.automatalib.util.minimizer.Block
getGraphDOTHelper() - Method in class net.automatalib.util.tries.SuffixTrie
getId() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizBrowserVisualizationProvider
getId() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizSwingVisualizationProvider
getId() - Method in class net.automatalib.util.minimizer.Block: Retrieves the ID of this block.
getInstance() - Static method in class net.automatalib.util.automata.random.RandomAutomata
getLabel() - Method in class net.automatalib.util.minimizer.BlockEdge: Retrieves the transition label.
getLocalInstance() - Static method in class net.automatalib.util.minimizer.Minimizer: Retrieves the local instance of this minimizer.
getMaxDepth() - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
getNodeProperty(S) - Method in class net.automatalib.util.automata.asgraph.UniversalAutomatonAsGraph
getNodes() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
getNodes() - Method in class net.automatalib.util.tries.SuffixTrie
getNumBlocks() - Method in class net.automatalib.util.minimizer.MinimizationResult: Retrieves the number of blocks in the final partition.
getNumBlocks() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves the total number of blocks in the block list.
getOutgoingEdgeArray(Block<S, L>) - Method in class net.automatalib.util.minimizer.BlockAutomaton: Retrieves an array of outgoing edges of a block (state).
getOutgoingEdges(S) - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
getOutgoingEdges(Block<S, L>) - Method in class net.automatalib.util.minimizer.BlockAutomaton: Retrieves a list of outgoing edges of a block (state).
getOutgoingEdges(SuffixTrieNode) - Method in class net.automatalib.util.tries.SuffixTrie
getParent() - Method in class net.automatalib.util.tries.SuffixTrieNode
getPriority() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizBrowserVisualizationProvider
getPriority() - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizSwingVisualizationProvider
getRepresentative(Block<S, L>) - Method in class net.automatalib.util.minimizer.MinimizationResult: Chooses a representative (i.e., an arbitrary element of the set of states) from a block.
getRepresentative(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves a representative state from the given block.
getRoot() - Method in class net.automatalib.util.tries.SuffixTrie: Returns the root of this trie.
getSource() - Method in class net.automatalib.util.minimizer.BlockEdge: Retrieves the source block.
getStateMapping() - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
getStateMapping() - Method in interface net.automatalib.util.automata.copy.LowLevelAutomatonCopier
getStateMapping() - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
getStatesInBlock(Block<S, L>) - Static method in class net.automatalib.util.minimizer.MinimizationResult: Retrieves all (original) states in a block.
getSuffix() - Method in class net.automatalib.util.tries.SuffixTrieNode
getSymbol(SuffixTrieNode, int) - Static method in class net.automatalib.util.tries.SuffixTrieNode
getSymbol() - Method in class net.automatalib.util.tries.SuffixTrieNode
getSymbol(int) - Method in class net.automatalib.util.tries.SuffixTrieNode
getTarget(TransitionEdge<I, T>) - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
getTarget() - Method in class net.automatalib.util.minimizer.BlockEdge: Retrieves the target block.
getTarget(SuffixTrieNode) - Method in class net.automatalib.util.tries.SuffixTrie
GraphCopy - Class in net.automatalib.util.graphs.copy
GraphCopy() - Constructor for class net.automatalib.util.graphs.copy.GraphCopy
GraphDOT - Class in net.automatalib.util.graphs.dot: Methods for rendering a Graph or Automaton in the GraphVIZ DOT format.
GraphDOT() - Constructor for class net.automatalib.util.graphs.dot.GraphDOT
Graphs - Class in net.automatalib.util.graphs
GraphTraversal - Class in net.automatalib.util.graphs.traversal
GraphTraversalAction - Enum in net.automatalib.util.graphs.traversal: The type of a GraphTraversalAction to be performed.
GraphTraversalVisitor<N,E,D> - Interface in net.automatalib.util.graphs.traversal: Visitor interface for graph traversals.
GraphVizBrowserVisualizationProvider - Class in net.automatalib.util.graphs.dot.visualization
GraphVizBrowserVisualizationProvider() - Constructor for class net.automatalib.util.graphs.dot.visualization.GraphVizBrowserVisualizationProvider
GraphVizSwingVisualizationProvider - Class in net.automatalib.util.graphs.dot.visualization
GraphVizSwingVisualizationProvider() - Constructor for class net.automatalib.util.graphs.dot.visualization.GraphVizSwingVisualizationProvider
grayTarget(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor

H

hasNext() - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
hasNext() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator
hasUndefinedInput(Automaton<?, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata
high - Variable in class net.automatalib.util.partitionrefinement.Block: The index of the last element in this block in the PaigeTarjan.blockData array, plus one.
HopcroftMinimization - Class in net.automatalib.util.automata.minimizer.hopcroft: Versions of Hopcroft's minimization algorithm for deterministic finite automata.
HopcroftMinimization() - Constructor for class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization
HopcroftMinimization.PruningMode - Enum in net.automatalib.util.automata.minimizer.hopcroft: Allows for controlling how automata are pruned during minimization.

I

id - Variable in class net.automatalib.util.partitionrefinement.Block
impl(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the implication ("=>") of two DFA, and stores the result in a given mutable DFA.
impl(DFA<?, I>, DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the implication ("=>") of two DFA, and returns the result as a new DFA.
IMPL - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner
impl(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
in - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
incomingEdges(Graph<N, E>) - Static method in class net.automatalib.util.graphs.Graphs
incrementalCharacterizingSet(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>, Collection<? extends Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata
incrementalCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word>, Collection<? extends Word>, Collection<? super Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata
incrementalStateCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata
incrementalStructuralCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>, Collection<? extends Word>, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata
IncrementalWMethodTestsIterator - Class in net.automatalib.util.automata.conformance: An iterator that enumerates the test cases as obtained through the W method conformance test in an incremental fashion.
IncrementalWMethodTestsIterator(Alphabet) - Constructor for class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
initBlockForStateMap() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Automatically creates a PaigeTarjan.blockForState mapping, and sets it as the current one.
initCompleteDeterministic(PaigeTarjan, UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>, PaigeTarjanInitializers.AutomatonInitialPartitioning, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers: Initializes the partition refinement data structure from a given abstracted deterministic automaton, using a predefined initial partitioning mode.
initCompleteDeterministic(PaigeTarjan, SimpleDeterministicAutomaton.FullIntAbstraction, IntFunction<?>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers: Initializes the partition refinement data structure from a given abstracted deterministic automaton, partitioning states according to the given classification function.
initDeterministic(PaigeTarjan, SimpleDeterministicAutomaton<S, I>, Alphabet, Function<? super S, ?>, Object) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers: Initializes the partition refinement data structure from a given deterministic automaton, initializing the initial partition according to the given classification function.
initDeterministic(PaigeTarjan, DeterministicAutomaton<S, I, T>, Alphabet, Predicate<? super S>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers: Initializes the partition refinement data structure from a given deterministic automaton, initializing the initial partition according to the given classification predicate (i.e., assuming a binary initial partitioning).
initialClassifier(UniversalDeterministicAutomaton.FullIntAbstraction<?, ?, ?>) - Method in enum net.automatalib.util.partitionrefinement.PaigeTarjanInitializers.AutomatonInitialPartitioning
initialClassifier(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Alphabet) - Method in enum net.automatalib.util.partitionrefinement.PaigeTarjanInitializers.AutomatonInitialPartitioning
initialize(N) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
initialize(N) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
initWorklist(boolean) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Initializes the worklist from the block list.
input - Variable in class net.automatalib.util.ts.TS.TransRef
inputAlphabet - Variable in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
inputIn(Object...) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputIn(Collection<?>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputIs(Object) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputIsNot(Object) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputNotIn(Object...) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputNotIn(Collection<?>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputs - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
inputs - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
inputSatisfying(Predicate<? super I>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
inputsMapping - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
insert(E) - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue: Inserts an element into the queue.
invasiveMinimize(A, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
isAccepting(IPair<S1, S2>) - Method in class net.automatalib.util.ts.acceptors.DetAcceptorComposition
isDotUsable() - Static method in class net.automatalib.util.graphs.dot.GraphDOT
isEmpty() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
isEmpty() - Method in class net.automatalib.util.graphs.Path
isEmpty() - Method in class net.automatalib.util.minimizer.Block: Checks whether or not this block is empty, i.e., contains no states.
isEmpty() - Method in class net.automatalib.util.partitionrefinement.Block: Checks whether this block is empty.
isRoot() - Method in class net.automatalib.util.tries.SuffixTrieNode
isSingleton() - Method in class net.automatalib.util.minimizer.Block: Checks whether or not this block is a singleton, i.e., contains only a single state.
iterator() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
iterator() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
iterator() - Method in class net.automatalib.util.graphs.Path
iterator() - Method in class net.automatalib.util.tries.SuffixTrieNode

L

l2Iterator(List) - Method in class net.automatalib.util.automata.conformance.WMethodTestsIterator
l3Iterator(List, Word) - Method in class net.automatalib.util.automata.conformance.WMethodTestsIterator
lastEdge() - Method in class net.automatalib.util.graphs.Path
length() - Method in class net.automatalib.util.tries.SuffixTrieNode
low - Variable in class net.automatalib.util.partitionrefinement.Block: The index of the first element in this block in the PaigeTarjan.blockData array.
LowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2> - Interface in net.automatalib.util.automata.copy

M

mapThreshold - Static variable in class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest
MealyFilter - Class in net.automatalib.util.automata.transout: Various utility methods to filter Mealy machines.
merge(E, E) - Method in interface net.automatalib.util.automata.conformance.StrictPriorityQueue.MergeOperation: Merges the old element and the new element into a replacement element.
MinimizationResult<S,L> - Class in net.automatalib.util.minimizer: The result structure of a minimization process.
minimize(UniversalDeterministicAutomaton<S, I, T, SP, TP>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.Automata
minimize(DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Minimizes the given DFA over the given alphabet.
minimize(A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Minimizes the given DFA.
minimize(UniversalGraph<S, ?, ?, L>) - Static method in class net.automatalib.util.minimizer.Minimizer: Minimizes an automaton.
minimize(UniversalGraph<S, ?, ?, L>, Collection<? extends S>) - Static method in class net.automatalib.util.minimizer.Minimizer
minimizeDFA(DFA<?, I>, Alphabet, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given DFA.
minimizeDFA(DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given DFA.
minimizeDFA(A, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given DFA.
minimizeDFA(A) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given DFA.
minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given Mealy machine.
minimizeMealy(MealyMachine<?, I, ?, O>, Alphabet) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given Mealy machine.
minimizeMealy(A, HopcroftMinimization.PruningMode) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given Mealy machine.
minimizeMealy(A) - Static method in class net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization: Minimizes the given Mealy machine.
Minimizer<S,L> - Class in net.automatalib.util.minimizer: Automaton minimizer.
Minimizer() - Constructor for class net.automatalib.util.minimizer.Minimizer: Deprecated.
Public instantiation is deprecated. Use Minimizer.getLocalInstance() or Minimizer.minimize(UniversalGraph)
MutableDFAs - Class in net.automatalib.util.automata.fsa

N

NearLinearEquivalenceTest - Class in net.automatalib.util.automata.equivalence
NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?, I, ?, ?, ?>) - Constructor for class net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest
net.automatalib.util.automata - package net.automatalib.util.automata
net.automatalib.util.automata.asgraph - package net.automatalib.util.automata.asgraph
net.automatalib.util.automata.builders - package net.automatalib.util.automata.builders
net.automatalib.util.automata.conformance - package net.automatalib.util.automata.conformance
net.automatalib.util.automata.copy - package net.automatalib.util.automata.copy
net.automatalib.util.automata.equivalence - package net.automatalib.util.automata.equivalence
net.automatalib.util.automata.fsa - package net.automatalib.util.automata.fsa
net.automatalib.util.automata.minimizer.hopcroft - package net.automatalib.util.automata.minimizer.hopcroft
net.automatalib.util.automata.predicates - package net.automatalib.util.automata.predicates
net.automatalib.util.automata.random - package net.automatalib.util.automata.random
net.automatalib.util.automata.transout - package net.automatalib.util.automata.transout
net.automatalib.util.graphs - package net.automatalib.util.graphs
net.automatalib.util.graphs.concepts - package net.automatalib.util.graphs.concepts
net.automatalib.util.graphs.copy - package net.automatalib.util.graphs.copy
net.automatalib.util.graphs.dot - package net.automatalib.util.graphs.dot
net.automatalib.util.graphs.dot.visualization - package net.automatalib.util.graphs.dot.visualization
net.automatalib.util.graphs.traversal - package net.automatalib.util.graphs.traversal
net.automatalib.util.minimizer - package net.automatalib.util.minimizer
net.automatalib.util.partitionrefinement - package net.automatalib.util.partitionrefinement
net.automatalib.util.traversal - package net.automatalib.util.traversal
net.automatalib.util.tries - package net.automatalib.util.tries
net.automatalib.util.ts - package net.automatalib.util.ts
net.automatalib.util.ts.acceptors - package net.automatalib.util.ts.acceptors
net.automatalib.util.ts.copy - package net.automatalib.util.ts.copy
net.automatalib.util.ts.traversal - package net.automatalib.util.ts.traversal
newDFA(Alphabet) - Static method in class net.automatalib.util.automata.builders.AutomatonBuilders
newMealy(Alphabet) - Static method in class net.automatalib.util.automata.builders.AutomatonBuilders
next() - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
next() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator
nextBlock - Variable in class net.automatalib.util.partitionrefinement.Block
nextInWorklist - Variable in class net.automatalib.util.partitionrefinement.Block
nextTouched - Variable in class net.automatalib.util.partitionrefinement.Block
NFAs - Class in net.automatalib.util.automata.fsa
NO_LIMIT - Static variable in class net.automatalib.util.ts.traversal.TSTraversal
nodeIDs() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
nodeIterator() - Method in class net.automatalib.util.graphs.Path
nodeList() - Method in class net.automatalib.util.graphs.Path
nodeProperties(UniversalIndefiniteGraph<N, ?, NP, ?>) - Static method in class net.automatalib.util.graphs.Graphs: Deprecated.
nodes() - Method in class net.automatalib.util.graphs.Path
nodes - Variable in class net.automatalib.util.tries.SuffixTrie
nontreeEdge(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
NOT_VISITED - Static variable in enum net.automatalib.util.traversal.VisitedState: Nodes that have not yet been visited.
numInputs - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The number of input symbols.
numStates - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The number of states.

O

offer(E) - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
or(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the disjunction ("or") of two DFA, and stores the result in a given mutable DFA.
or(DFA<?, I>, DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the disjunction ("or") of two DFA, and returns the result as a new DFA.
OR - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner
or(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors
out - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
outgoingEdges(Automaton<S, I, T>, S, Collection<? extends I>) - Static method in class net.automatalib.util.automata.asgraph.AGHelper
outputIn(TransitionOutput<? super T, ?>, Object...) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputIn(TransitionOutput<? super T, ?>, Collection<?>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputIs(TransitionOutput<? super T, ?>, Object) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputIsNot(TransitionOutput<? super T, ?>, Object) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputNotIn(TransitionOutput<? super T, ?>, Object...) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputNotIn(TransitionOutput<? super T, ?>, Collection<?>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputSatisfies(TransitionOutput<? super T, ? extends O>, Predicate<? super O>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
outputViolates(TransitionOutput<? super T, ? extends O>, Predicate<? super O>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates

P

PaigeTarjan - Class in net.automatalib.util.partitionrefinement: An implementation of the Paige/Tarjan partition refinement algorithm.
PaigeTarjan() - Constructor for class net.automatalib.util.partitionrefinement.PaigeTarjan
PaigeTarjan.WorklistPolicy - Enum in net.automatalib.util.partitionrefinement: Determines how the worklist is managed, i.e., where newly created blocks are inserted.
PaigeTarjanExtractors - Class in net.automatalib.util.partitionrefinement: This class provides methods for translating the result of a PaigeTarjan coarsest stable partition computation into several common, more usable forms such as automata.
PaigeTarjanExtractors() - Constructor for class net.automatalib.util.partitionrefinement.PaigeTarjanExtractors
PaigeTarjanInitializers - Class in net.automatalib.util.partitionrefinement: This class provides several methods to initialize a PaigeTarjan partition refinement data structure from common sources, e.g., automata.
PaigeTarjanInitializers() - Constructor for class net.automatalib.util.partitionrefinement.PaigeTarjanInitializers
PaigeTarjanInitializers.AutomatonInitialPartitioning - Enum in net.automatalib.util.partitionrefinement: This enum allows to conveniently specify how the states of a deterministic automaton are initially partitioned when initializing the partition refinement data structure.
Path<N,E> - Class in net.automatalib.util.graphs
Path(IndefiniteGraph<N, E>, N, List<? extends E>) - Constructor for class net.automatalib.util.graphs.Path
Path.PathData<N,E> - Class in net.automatalib.util.graphs
PathData(N, List<? extends E>) - Constructor for class net.automatalib.util.graphs.Path.PathData
peek() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
peekMin() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue: Retrieves, but does not remove the element at the head of the queue (i.e., the minimum element in the queue).
performMinimization(UniversalGraph<S, E, ?, L>) - Method in class net.automatalib.util.minimizer.Minimizer
performMinimization(UniversalGraph<S, E, ?, L>, Collection<? extends S>) - Method in class net.automatalib.util.minimizer.Minimizer: Performs the minimization of an automaton.
poll() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
posData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The array storing the position data, i.e., for each state, its index in the PaigeTarjan.blockData array.
posDataLow - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The lowest index storing position data in the PaigeTarjan.posData array.
predData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The array storing the predecessor data, i.e., for each state and input symbol, a list of the respective predecessors.
predOfsData - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The array storing the predecessor offset data, i.e., for each state and input symbol, the delimiting offsets of the respective predecessor list.
predOfsDataLow - Variable in class net.automatalib.util.partitionrefinement.PaigeTarjan: The lowest index storing predecessor offset data in the PaigeTarjan.predOfsData array.
processEdge(N, D, E, N, Holder<D>) - Method in class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
processEdge(N, D, E, N, Holder<D>) - Method in interface net.automatalib.util.graphs.traversal.GraphTraversalVisitor: Called when an edge is processed.
processInitial(N, Holder<D>) - Method in class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
processInitial(N, Holder<D>) - Method in interface net.automatalib.util.graphs.traversal.GraphTraversalVisitor: Called when a node is processed initially.
processInitial(S1, Holder<S2>) - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
processInitial(S, Holder<D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
processTransition(S1, S2, I1, T1, S1, Holder<S2>) - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
processTransition(S, D, I, T, S, Holder<D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
PropertyEdgeWeights<E> - Class in net.automatalib.util.graphs.concepts
PropertyEdgeWeights(UniversalGraph<?, E, ?, ? extends Number>) - Constructor for class net.automatalib.util.graphs.concepts.PropertyEdgeWeights
pruneTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet, O...) - Static method in class net.automatalib.util.automata.transout.MealyFilter: Returns a Mealy machine with all transitions removed that have one of the specified output values.
pruneTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet, Collection<? super O>) - Static method in class net.automatalib.util.automata.transout.MealyFilter: Returns a Mealy machine with all transitions removed that have one of the specified output values.
ptr - Variable in class net.automatalib.util.partitionrefinement.Block: The current pointer, i.e., the delimiter between elements of this block which were found to belong to a potential sub-class of this block, and those that do not or have not been checked.
put(Block<?, ?>, V) - Method in class net.automatalib.util.minimizer.BlockMap: Stores a value.

R

random - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
RandomAutomata - Class in net.automatalib.util.automata.random
RandomAutomata() - Constructor for class net.automatalib.util.automata.random.RandomAutomata
RandomAutomata(Random) - Constructor for class net.automatalib.util.automata.random.RandomAutomata
randomDeterministic(Random, int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomDeterministic(Random, int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A, boolean) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomDeterministic(int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Method in class net.automatalib.util.automata.random.RandomAutomata
randomDeterministic(int, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A, boolean) - Method in class net.automatalib.util.automata.random.RandomAutomata
RandomDeterministicAutomatonGenerator<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> - Class in net.automatalib.util.automata.random
RandomDeterministicAutomatonGenerator(Random, Collection<? extends I>, Collection<? extends SP>, Collection<? extends TP>, A) - Constructor for class net.automatalib.util.automata.random.RandomDeterministicAutomatonGenerator
randomDFA(Random, int, Alphabet, boolean) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomDFA(Random, int, Alphabet) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomDFA(int, Alphabet, boolean) - Method in class net.automatalib.util.automata.random.RandomAutomata
randomDFA(int, Alphabet) - Method in class net.automatalib.util.automata.random.RandomAutomata
randomDistinctState(int) - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
RandomICAutomatonGenerator<SP,TP> - Class in net.automatalib.util.automata.random: A random generator for initially connected (IC) deterministic automata.
RandomICAutomatonGenerator() - Constructor for class net.automatalib.util.automata.random.RandomICAutomatonGenerator
randomICDFA(Random, int, Alphabet, boolean) - Static method in class net.automatalib.util.automata.random.RandomAutomata: Randomly generates an initially connected DFA (ICDFA), i.e., a DFA where all states are reachable from the initial state.
randomInput() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
randomMealy(Random, int, Alphabet, Collection<? extends O>, boolean) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomMealy(Random, int, Alphabet, Collection<? extends O>) - Static method in class net.automatalib.util.automata.random.RandomAutomata
randomMealy(int, Alphabet, Collection<? extends O>, boolean) - Method in class net.automatalib.util.automata.random.RandomAutomata
randomMealy(int, Alphabet, Collection<? extends O>) - Method in class net.automatalib.util.automata.random.RandomAutomata
randomState() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
randomStateProperty() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
randomTransProperty() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies an Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies an Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I, T1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
rawCopy(AutomatonCopyMethod, Automaton<S1, ? super I, T1>, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonLowLevelCopy: Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I1, T1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies an TransitionSystem to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I1, T1>, int, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies an Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and state and transition properties.
rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I, T1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I, ? super T1>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
rawCopy(TSTraversalMethod, TransitionSystem<S1, ? super I, T1>, int, Collection<? extends I>, MutableAutomaton<S2, I, T2, SP2, TP2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.ts.copy.TSCopy: Copies an Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and transition properties.
remove() - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
remove() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator
removeEmptyBlocks() - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Removes all blocks which are empty from the block list.
retainTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet, O...) - Static method in class net.automatalib.util.automata.transout.MealyFilter: Returns a Mealy machine with all transitions removed that have an output not among the specified values.
retainTransitionsWithOutput(MealyMachine<?, I, ?, O>, Alphabet, Collection<? super O>) - Static method in class net.automatalib.util.automata.transout.MealyFilter: Returns a Mealy machine with all transitions removed that have an output not among the specified values.
root - Variable in class net.automatalib.util.tries.SuffixTrie

S

safePred(TransitionPredicate<S, I, T>, boolean) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
setBlockData(int[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setBlockForState(Block[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setMaxDepth(int) - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
setPosData(int[], int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setPredData(int[]) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setPredOfsData(int[], int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setSize(int, int) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
setWorklistPolicy(PaigeTarjan.WorklistPolicy) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan
SharedSuffixTrie - Class in net.automatalib.util.tries
SharedSuffixTrie(Alphabet) - Constructor for class net.automatalib.util.tries.SharedSuffixTrie
SharedSuffixTrie(Alphabet, boolean) - Constructor for class net.automatalib.util.tries.SharedSuffixTrie
shortestPath(IndefiniteGraph<N, E>, Collection<? extends N>, int, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPath(IndefiniteGraph<N, E>, N, int, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPath(IndefiniteGraph<N, E>, N, int, Collection<?>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPath(IndefiniteGraph<N, E>, N, int, N) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPath(IndefiniteGraph<N, E>, Collection<? extends N>, int, Collection<?>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPath(IndefiniteGraph<N, E>, Collection<? extends N>, int, N) - Static method in class net.automatalib.util.graphs.ShortestPaths
ShortestPaths - Class in net.automatalib.util.graphs: Unweighted shortest path search in graphs.
shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPaths(IndefiniteGraph<N, E>, N, int, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPaths(IndefiniteGraph<N, E>, N, int, N) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPaths(IndefiniteGraph<N, E>, N, int, Collection<?>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, N) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPaths(IndefiniteGraph<N, E>, Collection<? extends N>, int, Collection<?>) - Static method in class net.automatalib.util.graphs.ShortestPaths
shortestPathsIterator(IndefiniteGraph<N, E>, Collection<? extends N>, int, Predicate<? super N>) - Static method in class net.automatalib.util.graphs.ShortestPaths
size() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph
size() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
size() - Method in class net.automatalib.util.graphs.Path
size() - Method in class net.automatalib.util.minimizer.Block: Retrieves the size of this block, i.e., the number of states it contains.
size() - Method in class net.automatalib.util.partitionrefinement.Block: Retrieves the size of this block.
sourceSatisfying(Predicate<? super S>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
spList - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
split(int) - Method in class net.automatalib.util.partitionrefinement.Block: Splits this block, if applicable.
spMapping - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
start - Variable in class net.automatalib.util.graphs.Path.PathData
startExploration(N, D) - Method in class net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor
startExploration(N, D) - Method in interface net.automatalib.util.graphs.traversal.GraphTraversalVisitor: Called when the exploration of a node is started.
startExploration(S1, S2) - Method in class net.automatalib.util.ts.copy.TSCopyVisitor
startExploration(S, D) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor
state - Variable in class net.automatalib.util.ts.TS.TransRef
STATE_BY_STATE - Static variable in interface net.automatalib.util.automata.copy.AutomatonCopyMethod
stateCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S, Collection<? super Word>) - Static method in class net.automatalib.util.automata.Automata: Computes a characterizing set for a single state.
stateCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S) - Static method in class net.automatalib.util.automata.Automata: Computes a characterizing set for a single state, and returns it as a List.
stateCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
stateFilter - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
stateMapping - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
stateProperties(UniversalTransitionSystem<S, ?, ?, SP, ?>) - Static method in class net.automatalib.util.ts.TS
states - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
statesInBlockIterator(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves an iterator for the contents of the given block.
statesInBlockSpliterator(Block) - Method in class net.automatalib.util.partitionrefinement.PaigeTarjan: Retrieves a spliterator for the contents of the given block.
StrictPriorityQueue<E> - Class in net.automatalib.util.automata.conformance: A priority queue which enforces that no two elements that it contains are equal wrt. the specified comparator (i.e., Comparator.compare(Object, Object) does not return 0 for two distinct elements).
StrictPriorityQueue(Comparator<? super E>, StrictPriorityQueue.MergeOperation<E>) - Constructor for class net.automatalib.util.automata.conformance.StrictPriorityQueue: Constructor.
StrictPriorityQueue.MergeOperation<E> - Interface in net.automatalib.util.automata.conformance: The merge operation two perform on two equally-ranked elements.
SuffixTrie - Class in net.automatalib.util.tries
SuffixTrie() - Constructor for class net.automatalib.util.tries.SuffixTrie: Constructor.
SuffixTrie(boolean) - Constructor for class net.automatalib.util.tries.SuffixTrie: Constructor.
SuffixTrie(SuffixTrieNode) - Constructor for class net.automatalib.util.tries.SuffixTrie: Internal constructor.
SuffixTrie(boolean, SuffixTrieNode) - Constructor for class net.automatalib.util.tries.SuffixTrie: Internal constructor.
SuffixTrieNode - Class in net.automatalib.util.tries: A node in a SuffixTrie.
SuffixTrieNode() - Constructor for class net.automatalib.util.tries.SuffixTrieNode: Root constructor.
SuffixTrieNode(I, SuffixTrieNode) - Constructor for class net.automatalib.util.tries.SuffixTrieNode

T

testEquivalence(UniversalDeterministicAutomaton<?, I, ?, ?, ?>, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
toDeterministic(PaigeTarjan, AutomatonCreator<A, I>, Alphabet, DeterministicAutomaton<S1, I, T1>, StateIDs<S1>, Function<? super S1, ? extends SP>, Function<? super T1, ? extends TP>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanExtractors: Translates the results of a coarsest stable partition computation into a deterministic automaton.
toDeterministic(PaigeTarjan, AutomatonCreator<A, I>, Alphabet, DeterministicAutomaton.FullIntAbstraction<T>, IntFunction<? extends SP>, Function<? super T, ? extends TP>, boolean) - Static method in class net.automatalib.util.partitionrefinement.PaigeTarjanExtractors: Translates the results of a coarsest stable partition computation into a deterministic automaton.
toExplicitWord(SuffixTrieNode) - Static method in class net.automatalib.util.tries.SuffixTrieNode
toPath(IndefiniteGraph<N, E>) - Method in class net.automatalib.util.graphs.Path.PathData
toString() - Method in class net.automatalib.util.automata.conformance.StrictPriorityQueue
tpList - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator
tpMapping - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
transFilter - Variable in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier
transition - Variable in class net.automatalib.util.ts.TS.TransRef
transitionCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata
TransitionPredicates - Class in net.automatalib.util.automata.predicates
transitionProperties(UniversalTransitionSystem<?, ?, T, ?, TP>) - Static method in class net.automatalib.util.ts.TS
transitionSatisfying(Predicate<? super T>) - Static method in class net.automatalib.util.automata.predicates.TransitionPredicates
TransRef(S, I, T) - Constructor for class net.automatalib.util.ts.TS.TransRef
TransRef(S, I) - Constructor for class net.automatalib.util.ts.TS.TransRef
TraversalOrder - Enum in net.automatalib.util.traversal
traverse(TraversalOrder, IndefiniteGraph<N, E>, int, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
traverse(TraversalOrder, IndefiniteGraph<N, E>, int, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
traverse(TraversalOrder, IndefiniteGraph<N, E>, N, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
traverse(TraversalOrder, IndefiniteGraph<N, E>, Collection<? extends N>, GraphTraversalVisitor<N, E, D>) - Static method in class net.automatalib.util.graphs.traversal.GraphTraversal
traverse(TraversalOrder, TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
traverse(TraversalOrder, TransitionSystem<S, ? super I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal
traverse(TransitionSystem<S, ? super I, T>, int, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalMethod
treeEdge(N, D, E, N) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor
treeEdge(N, D, E, N) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor
TS - Class in net.automatalib.util.ts
TS() - Constructor for class net.automatalib.util.ts.TS
TS.TransRef<S,I,T> - Class in net.automatalib.util.ts
TSCopy - Class in net.automatalib.util.ts.copy
TSCopyVisitor<S1,I1,T1,S2,I2,T2,SP2,TP2> - Class in net.automatalib.util.ts.copy
TSCopyVisitor(TransitionSystem<S1, ? super I1, T1>, MutableAutomaton<S2, I2, T2, ? super SP2, ? super TP2>, Function<? super I1, ? extends I2>, Function<? super S1, ? extends SP2>, Function<? super T1, ? extends TP2>, Predicate<? super S1>, TransitionPredicate<? super S1, ? super I1, ? super T1>) - Constructor for class net.automatalib.util.ts.copy.TSCopyVisitor
TSTraversal - Class in net.automatalib.util.ts.traversal
TSTraversal() - Constructor for class net.automatalib.util.ts.traversal.TSTraversal
TSTraversalAction - Enum in net.automatalib.util.ts.traversal
TSTraversalMethod - Interface in net.automatalib.util.ts.traversal
TSTraversalVisitor<S,I,T,D> - Interface in net.automatalib.util.ts.traversal

U

undefinedInputs(TransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS
undefinedInputsIterator(TransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Static method in class net.automatalib.util.ts.TS
UniversalAutomatonAsGraph<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>> - Class in net.automatalib.util.automata.asgraph
UniversalAutomatonAsGraph(A, Collection<? extends I>) - Constructor for class net.automatalib.util.automata.asgraph.UniversalAutomatonAsGraph
update(UniversalDeterministicAutomaton<?, I, ?, ?, ?>) - Method in class net.automatalib.util.automata.conformance.IncrementalWMethodTestsIterator
updateInitials() - Method in class net.automatalib.util.automata.copy.AbstractLowLevelAutomatonCopier

V

valueOf(String) - Static method in enum net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization.PruningMode: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.graphs.traversal.GraphTraversalAction: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjanInitializers.AutomatonInitialPartitioning: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.traversal.Color: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.traversal.TraversalOrder: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.traversal.VisitedState: Returns the enum constant of this type with the specified name.
valueOf(String) - Static method in enum net.automatalib.util.ts.traversal.TSTraversalAction: Returns the enum constant of this type with the specified name.
values() - Static method in enum net.automatalib.util.automata.minimizer.hopcroft.HopcroftMinimization.PruningMode: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.graphs.traversal.GraphTraversalAction: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Method in class net.automatalib.util.minimizer.BlockMap: Retrieves all values that are stored in this map.
values() - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjan.WorklistPolicy: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.partitionrefinement.PaigeTarjanInitializers.AutomatonInitialPartitioning: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.traversal.Color: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.traversal.TraversalOrder: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.traversal.VisitedState: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Static method in enum net.automatalib.util.ts.traversal.TSTraversalAction: Returns an array containing the constants of this enum type, in the order they are declared.
VisitedState - Enum in net.automatalib.util.traversal: Enum to use for indicating if a node/state has been visited.
visualize(Graph<N, E>, GraphDOTHelper<N, ? super E>, boolean, Map<String, String>) - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizBrowserVisualizationProvider
visualize(Graph<N, E>, GraphDOTHelper<N, ? super E>, boolean, Map<String, String>) - Method in class net.automatalib.util.graphs.dot.visualization.GraphVizSwingVisualizationProvider

W

WHITE - Static variable in enum net.automatalib.util.traversal.Color: Color for nodes/states that have not yet been discovered.
withStateProperties(Supplier<? extends SP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the supplier for state properties, and returns this.
withStateProperties(Function<? super Random, ? extends SP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the function for supplying state properties, and returns this.
withStateProperties(Collection<? extends SP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the possible state properties, and returns this.
withStateProperties(SP...) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the possible state properties, and returns this.
withTransitionProperties(Supplier<? extends TP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the supplier for transition properties, and returns this.
withTransitionProperties(Function<? super Random, ? extends TP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the function for supplying transition properties, and returns this.
withTransitionProperties(Collection<? extends TP>) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the possible transition properties, and returns this.
withTransitionProperties(TP...) - Method in class net.automatalib.util.automata.random.RandomICAutomatonGenerator: Sets the possible transition properties, and returns this.
WMethodTestsIterator - Class in net.automatalib.util.automata.conformance
WMethodTestsIterator(Alphabet, UniversalDeterministicAutomaton<?, I, ?, ?, ?>, int) - Constructor for class net.automatalib.util.automata.conformance.WMethodTestsIterator
write(GraphViewable, Appendable) - Static method in class net.automatalib.util.graphs.dot.GraphDOT
write(Graph<N, E>, Appendable, GraphDOTHelper<N, ? super E>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT: Renders a Graph in the GraphVIZ DOT format.
write(Automaton<S, I, T>, GraphDOTHelper<S, ? super TransitionEdge<I, T>>, Collection<? extends I>, Appendable, GraphDOTHelper<S, ? super TransitionEdge<I, T>>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT: Renders an Automaton in the GraphVIZ DOT format.
write(Automaton<S, I, T>, Collection<? extends I>, Appendable, GraphDOTHelper<S, ? super TransitionEdge<I, T>>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT: Renders an Automaton in the GraphVIZ DOT format.
writeRaw(Graph<N, E>, GraphDOTHelper<N, ? super E>, Appendable, GraphDOTHelper<N, ? super E>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT
writeRaw(Graph<N, E>, Appendable, List<GraphDOTHelper<N, ? super E>>) - Static method in class net.automatalib.util.graphs.dot.GraphDOT
writeRaw(Graph<N, E>, GraphDOTHelper<N, ? super E>, Appendable) - Static method in class net.automatalib.util.graphs.dot.GraphDOT: Renders a Graph in the GraphVIZ DOT format.
writeToFileRaw(Graph<N, E>, GraphDOTHelper<N, E>, File) - Static method in class net.automatalib.util.graphs.dot.GraphDOT

X

xor(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the exclusive-or ("xor") of two DFA, and stores the result in a given mutable DFA.
xor(DFA<?, I>, DFA<?, I>, Alphabet) - Static method in class net.automatalib.util.automata.fsa.DFAs: Calculates the exclusive-or ("xor") of two DFA, and returns the result as a new DFA.
XOR - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner
xor(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors

A B C D E F G H I L M N O P R S T U V W X