|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object de.ls5.jlearn.util.AutomatonUtil
public class AutomatonUtil
Constructor Summary | |
---|---|
AutomatonUtil()
|
Method Summary | |
---|---|
static Automaton |
arraysToAutomaton(int[] transitions,
int[] outputs,
int sigma)
|
static int[] |
automatonToOutputArray(Automaton a)
|
static int[] |
automatonToTransitionArray(Automaton a)
|
static Automaton |
convertSymbolsToStrings(Automaton a)
|
static Word |
findCounterexample(Automaton a1,
Automaton a2)
will minimize the automata first |
static Word |
findCounterexample(Automaton a1,
Automaton a2,
boolean minimize)
|
static Word |
findDistinguishingSuffix(Automaton a,
State s1,
State s2)
Deprecated. |
static Word |
findDistinguishingSuffix(Automaton m,
Word p1,
Word p2)
Deprecated. |
static Set<Word> |
getCharacterizingSet(Automaton a)
|
static Automaton |
getCopyWithoutTransitions(Automaton aut,
Set<Symbol> forbiddentransitions)
|
static Automaton |
getCopyWithRestrictedAlphabet(Automaton aut,
Alphabet alpha)
Create a copy of an Automaton that only contains Symbols present in the specified Alphabet |
static List<State> |
getStatesInBFSOrder(Automaton automaton)
Applies a breadth-first search algorithm to retrieve all states reachable from the starting state. |
static Automaton |
minimize(Automaton in)
Deprecated. |
static boolean |
testEquivalence(Automaton t1,
Automaton t2)
will minimize the automata first |
static boolean |
testEquivalence(Automaton t1,
Automaton t2,
boolean minimize)
|
static Word |
testEquivalenceLinear(Automaton m1,
Automaton m2)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public AutomatonUtil()
Method Detail |
---|
public static boolean testEquivalence(Automaton t1, Automaton t2)
t1
- t2
-
public static boolean testEquivalence(Automaton t1, Automaton t2, boolean minimize)
t1
- t2
-
public static Word findCounterexample(Automaton a1, Automaton a2)
a1
- a2
-
public static Word findCounterexample(Automaton a1, Automaton a2, boolean minimize)
@Deprecated public static Word findDistinguishingSuffix(Automaton m, Word p1, Word p2)
m
- p1
- p2
-
@Deprecated public static Automaton minimize(Automaton in)
in
-
public static int[] automatonToOutputArray(Automaton a)
public static int[] automatonToTransitionArray(Automaton a)
public static Automaton arraysToAutomaton(int[] transitions, int[] outputs, int sigma)
public static Set<Word> getCharacterizingSet(Automaton a)
public static List<State> getStatesInBFSOrder(Automaton automaton)
@Deprecated public static Word findDistinguishingSuffix(Automaton a, State s1, State s2)
public static Automaton convertSymbolsToStrings(Automaton a)
public static Automaton getCopyWithRestrictedAlphabet(Automaton aut, Alphabet alpha)
aut
- Automaton to make a copy ofalpha
- The Alphabet to consider
public static Automaton getCopyWithoutTransitions(Automaton aut, Set<Symbol> forbiddentransitions)
public static Word testEquivalenceLinear(Automaton m1, Automaton m2)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |