|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.mindswap.pellet.utils.fsm.TransitionGraph<T>
public class TransitionGraph<T>
Title:
Description:
Copyright: Copyright (c) 2006
Company: Clark & Parsia, LLC.
Constructor Summary | |
---|---|
TransitionGraph()
|
Method Summary | ||
---|---|---|
boolean |
accepts(java.util.List<T> str)
|
|
void |
addFinalState(State<T> s)
|
|
void |
addTransition(State<T> begin,
State<T> end)
|
|
void |
addTransition(State<T> begin,
T transition,
State<T> end)
|
|
TransitionGraph<T> |
choice(TransitionGraph<T> t)
|
|
TransitionGraph<T> |
closure()
|
|
TransitionGraph<T> |
concat(TransitionGraph<T> t)
|
|
TransitionGraph<T> |
determinize()
|
|
TransitionGraph<T> |
epsilon()
|
|
java.util.Set<State<T>> |
epsilonClosure(java.util.Set<State<T>> stateSet)
|
|
java.util.Set<State<T>> |
epsilonClosure(State<T> s,
java.util.Set<State<T>> result)
|
|
java.util.List<Pair<State<T>,State<T>>> |
findTransitions(T transition)
|
|
java.util.Set<State<T>> |
getAllStates()
|
|
java.util.Set<T> |
getAlpahabet()
|
|
State<T> |
getFinalState()
|
|
java.util.Set<State<T>> |
getFinalStates()
|
|
State<T> |
getInitialState()
|
|
TransitionGraph<T> |
insert(TransitionGraph<T> tg,
State<T> i,
State<T> f)
|
|
boolean |
isAnyFinal(java.util.Set<State<T>> ss)
|
|
boolean |
isConnected()
|
|
boolean |
isDeterministic()
|
|
boolean |
isFinal(State<T> st)
|
|
boolean |
isInitial(State<T> st)
|
|
TransitionGraph<T> |
minimize()
|
|
java.util.Set<State<T>> |
move(java.util.Set<State<T>> stateSet,
T c)
|
|
State<T> |
newState()
|
|
TransitionGraph<T> |
renumber()
|
|
void |
setInitialState(State<T> s)
|
|
void |
setPartition(java.util.Set<State<T>> stateSet,
int num,
java.util.Map<State<T>,java.lang.Integer> partitions)
|
|
int |
size()
Returns the number of states in this transition graph |
|
static
|
symbol(T transition)
|
|
java.lang.String |
toString()
|
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public TransitionGraph()
Method Detail |
---|
public int size()
public State<T> newState()
public java.util.Set<T> getAlpahabet()
public java.util.Set<State<T>> getAllStates()
public void setInitialState(State<T> s)
public State<T> getInitialState()
public void addFinalState(State<T> s)
public java.util.Set<State<T>> getFinalStates()
public State<T> getFinalState()
public void addTransition(State<T> begin, T transition, State<T> end)
public void addTransition(State<T> begin, State<T> end)
public java.util.List<Pair<State<T>,State<T>>> findTransitions(T transition)
public boolean isInitial(State<T> st)
public boolean isFinal(State<T> st)
public boolean isAnyFinal(java.util.Set<State<T>> ss)
public TransitionGraph<T> epsilon()
public static <T> TransitionGraph<T> symbol(T transition)
public java.lang.String toString()
toString
in class java.lang.Object
public TransitionGraph<T> renumber()
public boolean accepts(java.util.List<T> str)
public TransitionGraph<T> choice(TransitionGraph<T> t)
public TransitionGraph<T> concat(TransitionGraph<T> t)
public TransitionGraph<T> closure()
public TransitionGraph<T> insert(TransitionGraph<T> tg, State<T> i, State<T> f)
public java.util.Set<State<T>> move(java.util.Set<State<T>> stateSet, T c)
public java.util.Set<State<T>> epsilonClosure(State<T> s, java.util.Set<State<T>> result)
public java.util.Set<State<T>> epsilonClosure(java.util.Set<State<T>> stateSet)
public boolean isDeterministic()
public boolean isConnected()
public TransitionGraph<T> determinize()
public void setPartition(java.util.Set<State<T>> stateSet, int num, java.util.Map<State<T>,java.lang.Integer> partitions)
public TransitionGraph<T> minimize()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |