| Package | Description |
|---|---|
| org.mindswap.pellet.utils.fsm |
| Modifier and Type | Method and Description |
|---|---|
State<T> |
TransitionGraph.getFinalState() |
State<T> |
TransitionGraph.getInitialState() |
State<T> |
Transition.getTo() |
State<T> |
State.move(T symbol)
Returns a state reached from this state with the given symbol.
|
State<T> |
TransitionGraph.newState() |
| Modifier and Type | Method and Description |
|---|---|
Set<State<T>> |
TransitionGraph.epsilonClosure(Set<State<T>> stateSet) |
Set<State<T>> |
TransitionGraph.epsilonClosure(State<T> s,
Set<State<T>> result) |
List<Pair<State<T>,State<T>>> |
TransitionGraph.findTransitions(T transition) |
List<Pair<State<T>,State<T>>> |
TransitionGraph.findTransitions(T transition) |
Set<State<T>> |
TransitionGraph.getAllStates() |
Set<State<T>> |
TransitionGraph.getFinalStates() |
Set<State<T>> |
TransitionGraph.move(Set<State<T>> stateSet,
T c) |
| Modifier and Type | Method and Description |
|---|---|
void |
TransitionGraph.addFinalState(State<T> s) |
void |
State.addTransition(State<T> s)
Create an epsilon transition from this state to the given state
|
void |
TransitionGraph.addTransition(State<T> begin,
State<T> end) |
void |
TransitionGraph.addTransition(State<T> begin,
State<T> end) |
void |
TransitionGraph.addTransition(State<T> begin,
T transition,
State<T> end) |
void |
TransitionGraph.addTransition(State<T> begin,
T transition,
State<T> end) |
void |
State.addTransition(T symbol,
State<T> s)
Create a transition from this state to the given state on
given symbol
|
Set<State<T>> |
TransitionGraph.epsilonClosure(State<T> s,
Set<State<T>> result) |
TransitionGraph<T> |
TransitionGraph.insert(TransitionGraph<T> tg,
State<T> i,
State<T> f) |
TransitionGraph<T> |
TransitionGraph.insert(TransitionGraph<T> tg,
State<T> i,
State<T> f) |
protected boolean |
TransitionGraph.isEquivalentState(State<T> s1,
State<T> s2,
Map<State<T>,Integer> partitionNum) |
protected boolean |
TransitionGraph.isEquivalentState(State<T> s1,
State<T> s2,
Map<State<T>,Integer> partitionNum) |
boolean |
TransitionGraph.isFinal(State<T> st) |
boolean |
TransitionGraph.isInitial(State<T> st) |
void |
TransitionGraph.setInitialState(State<T> s) |
void |
Transition.setTo(State<T> to) |
| Modifier and Type | Method and Description |
|---|---|
Set<State<T>> |
TransitionGraph.epsilonClosure(Set<State<T>> stateSet) |
Set<State<T>> |
TransitionGraph.epsilonClosure(State<T> s,
Set<State<T>> result) |
boolean |
TransitionGraph.isAnyFinal(Set<State<T>> ss) |
protected boolean |
TransitionGraph.isEquivalentState(State<T> s1,
State<T> s2,
Map<State<T>,Integer> partitionNum) |
Set<State<T>> |
TransitionGraph.move(Set<State<T>> stateSet,
T c) |
void |
TransitionGraph.setPartition(Set<State<T>> stateSet,
int num,
Map<State<T>,Integer> partitions) |
void |
TransitionGraph.setPartition(Set<State<T>> stateSet,
int num,
Map<State<T>,Integer> partitions) |
| Constructor and Description |
|---|
Transition(State<T> t)
/* add edge with epsilon edge
|
Transition(T name,
State<T> to)
add edge for name from current state to state t on c
|
Copyright © 2019. All rights reserved.