Package net.automatalib.ts.simple
Interface SimpleTS<S,I>
-
- Type Parameters:
S
- state class.I
- symbol class.
- All Known Subinterfaces:
AcceptorTS<S,I>
,Automaton<S,I,T>
,DeterministicAcceptorTS<S,I>
,DeterministicAutomaton<S,I,T>
,DeterministicOutputTS<S,I,T,O>
,DeterministicStateOutputTS<S,I,T,O>
,DeterministicTransitionOutputTS<S,I,T,O>
,DeterministicTransitionSystem<S,I,T>
,DetOutputAutomaton<S,I,T,D>
,DetSuffixOutputAutomaton<S,I,T,D>
,DFA<S,I>
,FiniteAlphabetAutomaton<S,I,T>
,FiniteKTS<S,I,T,AP>
,FiniteStateAcceptor<S,I>
,Lasso<I,D>
,Lasso.DFALasso<I>
,Lasso.MealyLasso<I,O>
,MealyMachine<S,I,T,O>
,MealyTransitionSystem<S,I,T,O>
,ModalTransitionSystem<S,I,T,TP>
,MooreMachine<S,I,T,O>
,MooreTransitionSystem<S,I,T,O>
,MutableAutomaton<S,I,T,SP,TP>
,MutableDeterministic<S,I,T,SP,TP>
,MutableDFA<S,I>
,MutableFSA<S,I>
,MutableMealyMachine<S,I,T,O>
,MutableModalTransitionSystem<S,I,T,TP>
,MutableMooreMachine<S,I,T,O>
,MutableNFA<S,I>
,MutableProbabilisticMealy<S,I,T,O>
,MutableSubsequentialTransducer<S,I,T,O>
,NFA<S,I>
,OneSEVPA<L,I>
,OutputAutomaton<S,I,T,D>
,PowersetViewTS<S,I,T,OS,OT>
,ProbabilisticMealyMachine<S,I,T,O>
,SBA<S,I>
,SEVPA<L,I>
,ShrinkableAutomaton<S,I,T,SP,TP>
,ShrinkableDeterministic<S,I,T,SP,TP>
,SimpleAutomaton<S,I>
,SimpleDeterministicAutomaton<S,I>
,SimpleDTS<S,I>
,SPA<S,I>
,SPMM<S,I,T,O>
,StateLocalInputMealyMachine<S,I,T,O>
,StateOutputAutomaton<S,I,T,O>
,SubsequentialTransducer<S,I,T,O>
,TransitionOutputAutomaton<S,I,T,O>
,TransitionSystem<S,I,T>
,UniversalAutomaton<S,I,T,SP,TP>
,UniversalDeterministicAutomaton<S,I,T,SP,TP>
,UniversalDTS<S,I,T,SP,TP>
,UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
,UniversalTransitionSystem<S,I,T,SP,TP>
- All Known Implementing Classes:
AbstractBricsAutomaton
,AbstractCompact
,AbstractCompactDeterministic
,AbstractCompactMTS
,AbstractCompactSimpleDeterministic
,AbstractCompactSimpleNondet
,AbstractDefaultSEVPA
,AbstractFastMutable
,AbstractFastMutableDet
,AbstractFastMutableNondet
,AbstractLasso
,AbstractSEVPA
,BricsDFA
,BricsNFA
,CompactDFA
,CompactMealy
,CompactMoore
,CompactMTS
,CompactNFA
,CompactSST
,DefaultNSEVPA
,DefaultOneSEVPA
,DeterministicPowersetView
,DFALassoImpl
,DirectPowersetDTS
,DTSComposition
,EmptySBA
,EmptySPA
,EmptySPMM
,FastDFA
,FastMealy
,FastMoore
,FastNFA
,FastPowersetDTS
,FastProbMealy
,MealyLassoImpl
,ProductOneSEVPA
,StackSBA
,StackSPA
,StackSPMM
,TSComposition
,UniversalCompactDet
,UniversalCompactSimpleDet
public interface SimpleTS<S,I>
A simple transition system. A transition system is a (not necessarily finite) collection of states. For an arbitrary input symbol, each state has a set of successors.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description default <@Nullable V>
MutableMapping<S,V>createDynamicStateMapping()
Creates aMutableMapping
allowing to associate arbitrary data with this transition system's states.default <@Nullable V>
MutableMapping<S,V>createStaticStateMapping()
Creates aMutableMapping
allowing to associate arbitrary data with this transition system's states.Set<S>
getInitialStates()
Retrieves the set of initial states of the transition system.default Set<S>
getStates(Iterable<? extends I> input)
Retrieves the set of all states reachable by the given sequence of input symbols from an initial state.default Set<S>
getSuccessors(Collection<? extends S> states, Iterable<? extends I> input)
Retrieves the set of all successors that can be reached from any of the given source states by the specified sequence of input symbols.Set<S>
getSuccessors(S state, I input)
Retrieves the set of successors for the given input symbol.default Set<S>
getSuccessors(S state, Iterable<? extends I> input)
Retrieves the set of successors for the given sequence of input symbols.
-
-
-
Method Detail
-
getSuccessors
default Set<S> getSuccessors(S state, Iterable<? extends I> input)
Retrieves the set of successors for the given sequence of input symbols.- Parameters:
state
- the source state.input
- the sequence of input symbols.- Returns:
- the set of successors reachable by this input.
-
getSuccessors
default Set<S> getSuccessors(Collection<? extends S> states, Iterable<? extends I> input)
Retrieves the set of all successors that can be reached from any of the given source states by the specified sequence of input symbols.- Parameters:
states
- the source states.input
- the sequence of input symbols.- Returns:
- the set of successors reachable by this input, or
null
if no successor states are reachable.
-
getSuccessors
Set<S> getSuccessors(S state, I input)
Retrieves the set of successors for the given input symbol.- Parameters:
state
- the source state.input
- the input symbol.- Returns:
- the set of successors reachable by this input.
-
getStates
default Set<S> getStates(Iterable<? extends I> input)
Retrieves the set of all states reachable by the given sequence of input symbols from an initial state. Calling this method is equivalent togetSuccessors(getInitialStates(), input)
.- Parameters:
input
- the sequence of input symbols.- Returns:
- the set of states reachable by this input from an initial state, or
null
if no successor state is reachable.
-
getInitialStates
Set<S> getInitialStates()
Retrieves the set of initial states of the transition system.- Returns:
- the initial states.
-
createStaticStateMapping
default <@Nullable V> MutableMapping<S,V> createStaticStateMapping()
Creates aMutableMapping
allowing to associate arbitrary data with this transition system's states. The returned mapping is however only guaranteed to work correctly if the transition system is not modified.- Type Parameters:
V
- the value type of the mapping- Returns:
- the mutable mapping
-
createDynamicStateMapping
default <@Nullable V> MutableMapping<S,V> createDynamicStateMapping()
Creates aMutableMapping
allowing to associate arbitrary data with this transition system's states. The returned mapping maintains the association even when the transition system is modified.- Type Parameters:
V
- the value type of the mapping- Returns:
- the mutable mapping
-
-