Modifier and Type | Interface and Description |
---|---|
interface |
MutableDFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
Modifier and Type | Method and Description |
---|---|
@Nullable Word<I> |
AbstractIncrementalDFADAGBuilder.findSeparatingWord(DFA<?,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
protected <S> @Nullable Word<I> |
IncrementalDFATreeBuilder.doFindSeparatingWord(DFA<S,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
protected <S> @Nullable Word<I> |
IncrementalPCDFATreeBuilder.doFindSeparatingWord(DFA<S,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
@Nullable Word<I> |
IncrementalDFATreeBuilder.findSeparatingWord(DFA<?,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
default void |
LTSminDFA.automaton2ETF(DFA<?,I> automaton,
Collection<? extends I> inputs,
File etf) |
default <S> void |
LTSminDFA.dfa2ETF(DFA<S,I> dfa,
Collection<? extends I> inputs,
File etf)
Writes the given
dfa to etf , while skipping rejecting states. |
Modifier and Type | Method and Description |
---|---|
@Nullable Lasso.DFALasso<I> |
LTSminLTLDFA.findCounterExample(DFA<?,I> automaton,
Collection<? extends I> inputs,
String property)
Converts the FSM file to a
Lasso.DFALasso . |
Modifier and Type | Method and Description |
---|---|
@Nullable DFA<?,I> |
LTSminMonitorDFA.findCounterExample(DFA<?,I> automaton,
Collection<? extends I> inputs,
String property)
Converts the FSM file to a
DFA . |
Modifier and Type | Method and Description |
---|---|
@Nullable DFA<?,I> |
LTSminMonitorDFA.findCounterExample(DFA<?,I> automaton,
Collection<? extends I> inputs,
String property)
Converts the FSM file to a
DFA . |
Modifier and Type | Interface and Description |
---|---|
static interface |
Lasso.DFALasso<I>
A DFALasso is a lasso for
DFA s. |
Modifier and Type | Class and Description |
---|---|
class |
DFALassoImpl<I>
A DFALasso is a lasso for
DFA s. |
Modifier and Type | Method and Description |
---|---|
protected void |
DFA2ETFWriter.writeETF(PrintWriter pw,
DFA<?,I> dfa,
Alphabet<I> inputs)
Write DFA specific parts in the ETF
|
void |
DFA2ETFWriter.writeModel(OutputStream os,
DFA<?,I> model,
Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
InputModelData<Integer,DFA<Integer,Integer>> |
LearnLibV2Serialization.readModel(InputStream is) |
Modifier and Type | Method and Description |
---|---|
<I> void |
LearnLibV2Serialization.writeGenericModel(OutputStream os,
DFA<?,I> model,
Alphabet<I> alphabet) |
void |
LearnLibV2Serialization.writeModel(OutputStream os,
DFA<?,Integer> model,
Alphabet<Integer> alphabet) |
Modifier and Type | Method and Description |
---|---|
InputModelData<Integer,DFA<Integer,Integer>> |
SAFSerializationDFA.readModel(InputStream is) |
Modifier and Type | Method and Description |
---|---|
<I> void |
SAFOutput.writeDFA(DFA<?,I> automaton,
Alphabet<I> alphabet) |
void |
SAFSerializationDFA.writeModel(OutputStream os,
DFA<?,Integer> model,
Alphabet<Integer> alphabet) |
Modifier and Type | Method and Description |
---|---|
InputModelData<String,DFA<Integer,String>> |
TAFSerializationDFA.readModel(InputStream is) |
Modifier and Type | Method and Description |
---|---|
void |
TAFSerializationDFA.writeModel(OutputStream os,
DFA<?,String> model,
Alphabet<String> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <I> void |
TAFWriter.dfaToString(DFA<?,I> dfa,
Collection<? extends I> inputs) |
static <I> void |
TAFWriter.writeDFA(DFA<?,I> dfa,
Collection<? extends I> inputs,
File out) |
static <S,I> void |
TAFWriter.writeDFA(DFA<S,I> dfa,
Collection<? extends I> inputs,
Appendable out) |
Modifier and Type | Method and Description |
---|---|
static <S,I,A extends DFA<S,I> & InputAlphabetHolder<I>> |
DFAs.minimize(A dfa)
Minimizes the given DFA.
|
Modifier and Type | Method and Description |
---|---|
static <S> boolean |
DFAs.acceptsEmptyLanguage(DFA<S,?> dfa)
Computes whether the given
DFA accepts the empty language. |
static <I> CompactDFA<I> |
DFAs.and(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the conjunction ("and") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.and(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the conjunction ("and") of two DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.and(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the conjunction ("and") of two DFA, and stores the result in a given mutable DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.and(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the conjunction ("and") of two DFA, and stores the result in a given mutable DFA.
|
static <I> CompactDFA<I> |
DFAs.combine(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet,
AcceptanceCombiner combiner)
Most general way of combining two DFAs.
|
static <I> CompactDFA<I> |
DFAs.combine(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet,
AcceptanceCombiner combiner)
Most general way of combining two DFAs.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.combine(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out,
AcceptanceCombiner combiner)
Most general way of combining two DFAs.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.combine(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out,
AcceptanceCombiner combiner)
Most general way of combining two DFAs.
|
static <I> CompactDFA<I> |
DFAs.complement(DFA<?,I> dfa,
Alphabet<I> inputAlphabet)
Calculates the complement (negation) of a DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.complement(DFA<?,I> dfa,
Collection<? extends I> inputs,
A out)
Calculates the complement (negation) of a DFA, and stores the result in a given mutable DFA.
|
static <I> CompactDFA<I> |
DFAs.complete(DFA<?,I> dfa,
Alphabet<I> inputs) |
static <I,S,A extends MutableDFA<S,I>> |
DFAs.complete(DFA<?,I> dfa,
Collection<? extends I> inputs,
A out) |
static <I> CompactDFA<I> |
DFAs.equiv(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the equivalence ("<=>") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.equiv(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the equivalence ("<=>") of two DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.equiv(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the equivalence ("<=>") of two DFA, and stores the result in a given mutable DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.equiv(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the equivalence ("<=>") of two DFA, and stores the result in a given mutable DFA.
|
static <I> CompactDFA<I> |
DFAs.impl(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the implication ("=>") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.impl(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the implication ("=>") of two DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.impl(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the implication ("=>") of two DFA, and stores the result in a given mutable DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.impl(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the implication ("=>") of two DFA, and stores the result in a given mutable DFA.
|
static <S,I> boolean |
DFAs.isPrefixClosed(DFA<S,I> dfa,
Alphabet<I> alphabet)
Computes whether the language of the given DFA is prefix-closed.
|
static <I> CompactDFA<I> |
DFAs.minimize(DFA<?,I> dfa,
Alphabet<I> alphabet)
Minimizes the given DFA over the given alphabet.
|
static <I> CompactDFA<I> |
DFAs.or(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the disjunction ("or") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.or(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the disjunction ("or") of two DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.or(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the disjunction ("or") of two DFA, and stores the result in a given mutable DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.or(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the disjunction ("or") of two DFA, and stores the result in a given mutable DFA.
|
static <I> CompactDFA<I> |
DFAs.xor(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the exclusive-or ("xor") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.xor(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the exclusive-or ("xor") of two DFA, and returns the result as a new DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.xor(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the exclusive-or ("xor") of two DFA, and stores the result in a given mutable DFA.
|
static <I,S,A extends MutableDFA<S,I>> |
DFAs.xor(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Collection<? extends I> inputs,
A out)
Calculates the exclusive-or ("xor") of two DFA, and stores the result in a given mutable DFA.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,A extends DFA<S,I> & InputAlphabetHolder<I>> |
HopcroftMinimization.minimizeDFA(A dfa)
Minimizes the given DFA.
|
static <S,I,A extends DFA<S,I> & InputAlphabetHolder<I>> |
HopcroftMinimization.minimizeDFA(A dfa,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given DFA.
|
Modifier and Type | Method and Description |
---|---|
static <I> CompactDFA<I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet)
Minimizes the given DFA.
|
static <I> CompactDFA<I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given DFA.
|
static <A extends MutableDFA<?,I>,I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode,
AutomatonCreator<A,I> creator)
Minimizes the given DFA.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,A extends DFA<S,I> & InputAlphabetHolder<I>> |
PaigeTarjanMinimization.minimizeDFA(A dfa)
Minimizes the given DFA.
|
Modifier and Type | Method and Description |
---|---|
static <I> CompactDFA<I> |
PaigeTarjanMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet)
Minimizes the given DFA.
|
static <A extends MutableDFA<?,I>,I> |
PaigeTarjanMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
AutomatonCreator<A,I> creator)
Minimizes the given DFA.
|
Copyright © 2020. All rights reserved.