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

A

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

accepts(Iterable<I>) - Method in class net.automatalib.util.ts.acceptors.DetAcceptorComposition

add(I, SuffixTrieNode<I>) - Method in class net.automatalib.util.tries.SharedSuffixTrie

add(I, SuffixTrieNode<I>) - 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

allDefinedTransitions(DeterministicAutomaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata

allDefinedTransitions(DeterministicTransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

allDefinedTransitionsIterator(DeterministicAutomaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata

allDefinedTransitionsIterator(DeterministicTransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

allTransitions(TransitionSystem<S, I, T>, S, Collection<I>) - Static method in class net.automatalib.util.ts.TS

allUndefinedTransitions(DeterministicAutomaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata

allUndefinedTransitions(DeterministicTransitionSystem<S, I, ?>, Iterable<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

allUndefinedTransitionsIterator(DeterministicAutomaton<S, I, ?>, Iterable<? extends I>) - Static method in class net.automatalib.util.automata.Automata

allUndefinedTransitionsIterator(DeterministicTransitionSystem<S, I, ?>, Iterator<? extends S>, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

and(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs

and(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

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<I>, 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

AutomatonCopy - 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

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

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.

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.

BlockEdge<S,L> - Class in net.automatalib.util.minimizer

An edge in a BlockAutomaton.

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.

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, 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, 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<I>>) - 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

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(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A, AcceptanceCombiner) - Static method in class net.automatalib.util.automata.fsa.DFAs

combine(DFA<?, I>, DFA<?, I>, Alphabet<I>, AcceptanceCombiner) - Static method in class net.automatalib.util.automata.fsa.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

complement(DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

copyDfs(TransitionSystem<S1, I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, SP2, TP2>, Mapping<? super S1, ? extends SP2>, Mapping<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyPlain(Automaton<S1, I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, SP2, TP2>, Mapping<? super I1, ? extends I2>, Mapping<? super S1, ? extends SP2>, Mapping<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyPlain(Automaton<S1, I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, SP2, TP2>, Mapping<? super S1, ? extends SP2>, Mapping<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

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

copyTraversal(TraversalOrder, int, TransitionSystem<S1, I1, T1>, Collection<? extends I1>, MutableAutomaton<S2, I2, T2, SP2, TP2>, Mapping<? super I1, ? extends I2>, Mapping<? super S1, ? extends SP2>, Mapping<? super T1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

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

copyUniversalDfs(UniversalTransitionSystem<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, SP2, TP2>, Mapping<? super I1, ? extends I2>, Mapping<? super SP1, ? extends SP2>, Mapping<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalDfs(UniversalTransitionSystem<S1, I1, ?, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, ? super I1, ?, SP2, TP2>, Mapping<? super SP1, ? extends SP2>, Mapping<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalDfs(UniversalTransitionSystem<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, ? super SP1, ? super TP1>, Mapping<? super I1, ? extends I2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalDfs(UniversalTransitionSystem<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, ? super I1, ?, ? super SP1, ? super TP1>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalPlain(UniversalAutomaton<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, SP2, TP2>, Mapping<? super I1, ? extends I2>, Mapping<? super SP1, ? extends SP2>, Mapping<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalPlain(UniversalAutomaton<S1, I1, ?, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, ? super I1, ?, SP2, TP2>, Mapping<? super SP1, ? extends SP2>, Mapping<? super TP1, ? extends TP2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalPlain(UniversalAutomaton<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, I2, ?, ? super SP1, ? super TP1>, Mapping<? super I1, ? extends I2>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

copyUniversalPlain(UniversalAutomaton<S1, I1, T1, SP1, TP1>, Collection<? extends I1>, MutableAutomaton<S2, ? super I1, ?, ? super SP1, ? super TP1>) - Static method in class net.automatalib.util.automata.copy.AutomatonCopy

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<I>>, Collection<? super Word<I>>) - Static method in class net.automatalib.util.automata.Automata

createDynamicNodeMapping() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph

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

definedTransitions(DeterministicTransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

definedTransitionsIterator(DeterministicTransitionSystem<S, I, ?>, S, Iterator<? extends I>) - Static method in class net.automatalib.util.ts.TS

depth(SuffixTrieNode<I>) - Static method in class net.automatalib.util.tries.SuffixTrieNode

depth() - Method in class net.automatalib.util.tries.SuffixTrieNode

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, 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<I> - Class in net.automatalib.util.automata.equivalence

DeterministicEquivalenceTest(UniversalDeterministicAutomaton<?, I, ?, ?, ?>) - Constructor for class net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest

DFAs - Class in net.automatalib.util.automata.fsa

DFAs() - Constructor for class net.automatalib.util.automata.fsa.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(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

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

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

equiv(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

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

F

findCharacterizingSet(UniversalDeterministicAutomaton<S, I, T, ?, ?>, Collection<? extends I>, S, Collection<? super Word<I>>) - 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<I>>) - Static method in class net.automatalib.util.automata.equivalence.CharacterizingSets

Computes a characterizing set for the given automaton.

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

findShortestPath(IndefiniteGraph<N, E>, int, N, Collection<? extends N>) - Static method in class net.automatalib.util.graphs.Graphs

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

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

get(N) - Method in class net.automatalib.util.graphs.OutEdgesMapping

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.

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.minimizer.Block

Retrieves the ID of this block.

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.

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.

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<I>) - Method in class net.automatalib.util.tries.SuffixTrie

getParent() - Method in class net.automatalib.util.tries.SuffixTrieNode

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.

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.

getStateProperty(Pair<S1, S2>) - Method in class net.automatalib.util.ts.acceptors.DetAcceptorComposition

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<I>, 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<I>) - Method in class net.automatalib.util.tries.SuffixTrie

getTransitionProperty(Pair<S1, S2>) - Method in class net.automatalib.util.ts.acceptors.DetAcceptorComposition

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.

grayTarget(N, D, E, N, D) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor

H

hasNext() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator

I

impl(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs

impl(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

IMPL - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner

impl(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors

incomingEdges(Graph<N, E>) - Static method in class net.automatalib.util.graphs.Graphs

initialize(N) - Method in class net.automatalib.util.graphs.traversal.BaseDFSVisitor

initialize(N) - Method in interface net.automatalib.util.graphs.traversal.DFSVisitor

input - Variable in class net.automatalib.util.ts.TS.TransRef

inputAlphabet - Variable in class net.automatalib.util.automata.asgraph.AutomatonAsGraph

inputs - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

invasiveMinimize(A, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata

isAccepting(Pair<S1, S2>) - Method in class net.automatalib.util.ts.acceptors.DetAcceptorComposition

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.

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.graphs.Path

iterator() - Method in class net.automatalib.util.tries.SuffixTrieNode

L

lastEdge() - Method in class net.automatalib.util.graphs.Path

length() - Method in class net.automatalib.util.tries.SuffixTrieNode

M

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(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

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 #apply(AutomatonInterface)

N

NearLinearEquivalenceTest<I> - 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.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.random - package net.automatalib.util.automata.random

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.traversal - package net.automatalib.util.graphs.traversal

net.automatalib.util.minimizer - package net.automatalib.util.minimizer

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.traversal - package net.automatalib.util.ts.traversal

next() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator

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

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.

O

or(DFA<?, I>, DFA<?, I>, Collection<? extends I>, A) - Static method in class net.automatalib.util.automata.fsa.DFAs

or(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

OR - Static variable in interface net.automatalib.util.ts.acceptors.AcceptanceCombiner

or(TS1, TS2) - Static method in class net.automatalib.util.ts.acceptors.Acceptors

OutEdgesMapping<N,E> - Class in net.automatalib.util.graphs

OutEdgesMapping(Graph<N, E>) - Constructor for class net.automatalib.util.graphs.OutEdgesMapping

outgoingEdges(Automaton<S, I, T>, S, Collection<? extends I>) - Static method in class net.automatalib.util.automata.asgraph.AGHelper

P

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

Path.PathData(N, List<? extends E>) - Constructor for class net.automatalib.util.graphs.Path.PathData

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.

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(S, Holder<D>) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor

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

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

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

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

randomDistinctState(int) - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

randomInput() - Method in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

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

remove() - Method in class net.automatalib.util.ts.traversal.BFSOrderIterator

root - Variable in class net.automatalib.util.tries.SuffixTrie

S

SharedSuffixTrie<I> - Class in net.automatalib.util.tries

SharedSuffixTrie(Alphabet<I>) - Constructor for class net.automatalib.util.tries.SharedSuffixTrie

SharedSuffixTrie(Alphabet<I>, boolean) - Constructor for class net.automatalib.util.tries.SharedSuffixTrie

size() - Method in class net.automatalib.util.automata.asgraph.AutomatonAsGraph

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.

spList - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

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(S, D) - Method in interface net.automatalib.util.ts.traversal.TSTraversalVisitor

state - Variable in class net.automatalib.util.ts.TS.TransRef

stateCharacterizingSet(UniversalDeterministicAutomaton<S, I, ?, ?, ?>, Collection<? extends I>, S, Collection<? super Word<I>>) - 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

stateProperties(UniversalTransitionSystem<S, ?, ?, SP, ?>) - Static method in class net.automatalib.util.ts.TS

states - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

SuffixTrie<I> - 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<I>) - Constructor for class net.automatalib.util.tries.SuffixTrie

Internal constructor.

SuffixTrie(boolean, SuffixTrieNode<I>) - Constructor for class net.automatalib.util.tries.SuffixTrie

Internal constructor.

SuffixTrieNode<I> - 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<I>) - Constructor for class net.automatalib.util.tries.SuffixTrieNode

T

toExplicitWord(SuffixTrieNode<I>) - Static method in class net.automatalib.util.tries.SuffixTrieNode

toPath(IndefiniteGraph<N, E>) - Method in class net.automatalib.util.graphs.Path.PathData

tpList - Variable in class net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator

transitionCover(DeterministicAutomaton<?, I, ?>, Collection<? extends I>) - Static method in class net.automatalib.util.automata.Automata

transitionProperties(UniversalTransitionSystem<?, ?, T, ?, TP>) - Static method in class net.automatalib.util.ts.TS

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, 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, I, T>, Collection<? extends I>, TSTraversalVisitor<S, I, T, D>) - Static method in class net.automatalib.util.ts.traversal.TSTraversal

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> - Class in net.automatalib.util.ts

TS.TransRef(S, I) - Constructor for class net.automatalib.util.ts.TS.TransRef

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

TSTraversalVisitor<S,I,T,D> - Interface in net.automatalib.util.ts.traversal

U

undefinedTransitions(DeterministicTransitionSystem<S, I, ?>, S, Iterable<? extends I>) - Static method in class net.automatalib.util.ts.TS

undefinedTransitionsIterator(DeterministicTransitionSystem<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

V

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.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.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.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.

W

WHITE - Static variable in enum net.automatalib.util.traversal.Color

Color for nodes/states that have not yet been discovered.

write(DOTPlottableGraph<N, E>, Appendable, GraphDOTHelper<N, ? super E>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT

Renders a DOTPlottableGraph 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.

write(DOTPlottableAutomaton<S, I, T>, Appendable, GraphDOTHelper<S, ? super TransitionEdge<I, T>>...) - 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(Graph<N, E>, GraphDOTHelper<N, ? super E>, Appendable, GraphDOTHelper<N, ? super E>...) - Static method in class net.automatalib.util.graphs.dot.GraphDOT

write(Graph<N, E>, Appendable, List<GraphDOTHelper<N, ? super E>>) - Static method in class net.automatalib.util.graphs.dot.GraphDOT

write(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.

writeToFile(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

xor(DFA<?, I>, DFA<?, I>, Alphabet<I>) - Static method in class net.automatalib.util.automata.fsa.DFAs

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