org.mindswap.pellet.utils.fsm

Class TransitionGraph<T>

java.lang.Object

org.mindswap.pellet.utils.fsm.TransitionGraph<T>

public class TransitionGraph<T>
extends Object

Title:

Description:

Copyright: Copyright (c) 2006

Company: Clark & Parsia, LLC.

Author:

Evren Sirin

Constructor Summary

Constructors

Constructor and Description
TransitionGraph()

Method Summary

Modifier and Type	Method and Description
boolean	accepts(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()
Set<State<T>>	epsilonClosure(Set<State<T>> stateSet)
Set<State<T>>	epsilonClosure(State<T> s, Set<State<T>> result)
List<Pair<State<T>,State<T>>>	findTransitions(T transition)
Set<State<T>>	getAllStates()
Set<T>	getAlpahabet()
State<T>	getFinalState()
Set<State<T>>	getFinalStates()
State<T>	getInitialState()
TransitionGraph<T>	insert(TransitionGraph<T> tg, State<T> i, State<T> f)
boolean	isAnyFinal(Set<State<T>> ss)
boolean	isConnected()
boolean	isDeterministic()
protected boolean	isEquivalentState(State<T> s1, State<T> s2, Map<State<T>,Integer> partitionNum)
boolean	isFinal(State<T> st)
boolean	isInitial(State<T> st)
TransitionGraph<T>	minimize()
Set<State<T>>	move(Set<State<T>> stateSet, T c)
State<T>	newState()
TransitionGraph<T>	renumber()
void	setInitialState(State<T> s)
void	setPartition(Set<State<T>> stateSet, int num, Map<State<T>,Integer> partitions)
int	size() Returns the number of states in this transition graph
static <T> TransitionGraph<T>	symbol(T transition)
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

TransitionGraph

public TransitionGraph()

Method Detail

size

public int size()

Returns the number of states in this transition graph

Returns:

newState

public State<T> newState()

getAlpahabet

public Set<T> getAlpahabet()

getAllStates

public Set<State<T>> getAllStates()

setInitialState

public void setInitialState(State<T> s)

getInitialState

public State<T> getInitialState()

addFinalState

public void addFinalState(State<T> s)

getFinalStates

public Set<State<T>> getFinalStates()

getFinalState

public State<T> getFinalState()

addTransition

public void addTransition(State<T> begin,
                          T transition,
                          State<T> end)

addTransition

public void addTransition(State<T> begin,
                          State<T> end)

findTransitions

public List<Pair<State<T>,State<T>>> findTransitions(T transition)

isInitial

public boolean isInitial(State<T> st)

isFinal

public boolean isFinal(State<T> st)

isAnyFinal

public boolean isAnyFinal(Set<State<T>> ss)

epsilon

public TransitionGraph<T> epsilon()

symbol

public static <T> TransitionGraph<T> symbol(T transition)

toString

public String toString()

Overrides:

toString in class Object

renumber

public TransitionGraph<T> renumber()

accepts

public boolean accepts(List<T> str)

choice

public TransitionGraph<T> choice(TransitionGraph<T> t)

concat

public TransitionGraph<T> concat(TransitionGraph<T> t)

closure

public TransitionGraph<T> closure()

insert

public TransitionGraph<T> insert(TransitionGraph<T> tg,
                                 State<T> i,
                                 State<T> f)

move

public Set<State<T>> move(Set<State<T>> stateSet,
                          T c)

epsilonClosure

public Set<State<T>> epsilonClosure(State<T> s,
                                    Set<State<T>> result)

epsilonClosure

public Set<State<T>> epsilonClosure(Set<State<T>> stateSet)

isDeterministic

public boolean isDeterministic()

isConnected

public boolean isConnected()

determinize

public TransitionGraph<T> determinize()

setPartition

public void setPartition(Set<State<T>> stateSet,
                         int num,
                         Map<State<T>,Integer> partitions)

minimize

public TransitionGraph<T> minimize()

isEquivalentState

protected boolean isEquivalentState(State<T> s1,
                                    State<T> s2,
                                    Map<State<T>,Integer> partitionNum)