edu.stanford.nlp.fsm
Class DFSAState<T,S>
java.lang.Object
edu.stanford.nlp.fsm.DFSAState<T,S>
- All Implemented Interfaces:
- Scored
public final class DFSAState<T,S>
- extends Object
- implements Scored
DFSAState
Class for representing the state of a deterministic finite state
automaton without epsilon transitions.
- Author:
- Dan Klein
stateID
public S stateID
inputToTransition
public Map<T,DFSATransition<T,S>> inputToTransition
accepting
public boolean accepting
dfsa
public DFSA<T,S> dfsa
score
public double score
DFSAState
public DFSAState(S id,
DFSA<T,S> dfsa)
DFSAState
public DFSAState(S id,
DFSA<T,S> dfsa,
double score)
score
public double score()
- Specified by:
score
in interface Scored
- Returns:
- The score of this thing.
setScore
public void setScore(double score)
dfsa
public DFSA dfsa()
setStateID
public void setStateID(S stateID)
stateID
public S stateID()
addTransition
public void addTransition(DFSATransition<T,S> transition)
transition
public DFSATransition<T,S> transition(T input)
transitions
public Collection<DFSATransition<T,S>> transitions()
continuingInputs
public Set<T> continuingInputs()
successorStates
public Set<DFSAState<T,S>> successorStates()
setAccepting
public void setAccepting(boolean accepting)
isAccepting
public boolean isAccepting()
isContinuable
public boolean isContinuable()
toString
public String toString()
- Overrides:
toString
in class Object
hashCode
public int hashCode()
- Overrides:
hashCode
in class Object
equals
public boolean equals(Object o)
- Overrides:
equals
in class Object
statesReachable
public Set statesReachable()
Stanford NLP Group