S- state class
I- input symbol class
T- transition class
SP- state property class
TP- transition property class
public interface UniversalTransitionSystem<S,I,T,SP,TP> extends TransitionSystem<S,I,T>
TransitionSysteminterface. For example, neither is whether a state is initial or not a state property, nor is a transition's successor a transition property. A common example are finite state acceptors (FSAs), such as deterministic finite automata (DFAs). A state can be accepting or non-accepting, thus the state property would likely be a
Booleansignaling acceptance. Transitions have are characterized by their successor state only, thus the transition property would most adequately be realized by the
Voidclass. In contrast, in a Mealy Machine do not distinguish between accepting or rejecting states, but transitions generate output symbols. The state property would therefore be
Void, but the transition property would be the output produced by this transition.
|Modifier and Type||Method and Description|
Retrieves the state property for the given state.
Retrieves the transition property for the given state.
getSuccessor, getTransitions, powersetView
SP getStateProperty(S state)
state- the state.
Copyright © 2015. All Rights Reserved.