Package net.automatalib.automaton
Interface UniversalAutomaton<S,I,T,SP,TP>
-
- Type Parameters:
S
- state classI
- input symbol classT
- transition classSP
- state property classTP
- transition property class
- All Superinterfaces:
Automaton<S,I,T>
,FiniteRepresentation
,Iterable<S>
,SimpleAutomaton<S,I>
,SimpleTS<S,I>
,TransitionSystem<S,I,T>
,UniversalTransitionSystem<S,I,T,SP,TP>
- All Known Subinterfaces:
DFA<S,I>
,FiniteStateAcceptor<S,I>
,Lasso.DFALasso<I>
,Lasso.MealyLasso<I,O>
,MealyMachine<S,I,T,O>
,ModalTransitionSystem<S,I,T,TP>
,MooreMachine<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>
,ShrinkableAutomaton<S,I,T,SP,TP>
,ShrinkableDeterministic<S,I,T,SP,TP>
,StateLocalInputMealyMachine<S,I,T,O>
,SubsequentialTransducer<S,I,T,O>
,UniversalDeterministicAutomaton<S,I,T,SP,TP>
,UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP>
- All Known Implementing Classes:
AbstractBricsAutomaton
,AbstractCompact
,AbstractCompactDeterministic
,AbstractCompactMTS
,AbstractCompactSimpleDeterministic
,AbstractCompactSimpleNondet
,AbstractFastMutable
,AbstractFastMutableDet
,AbstractFastMutableNondet
,BricsDFA
,BricsNFA
,CompactDFA
,CompactMealy
,CompactMoore
,CompactMTS
,CompactNFA
,CompactSST
,DFALassoImpl
,FastDFA
,FastMealy
,FastMoore
,FastNFA
,FastProbMealy
,MealyLassoImpl
,UniversalCompactDet
,UniversalCompactSimpleDet
public interface UniversalAutomaton<S,I,T,SP,TP> extends Automaton<S,I,T>, UniversalTransitionSystem<S,I,T,SP,TP>
A universal automaton is a generalized representation of automata, with unified access to the properties of states and transitions. SeeUniversalTransitionSystem
for a further explanation of this concept.
-
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default UniversalGraph<S,TransitionEdge<I,T>,SP,TransitionEdge.Property<I,TP>>
transitionGraphView(Collection<? extends I> inputs)
Obtains agraph
view of the transition graph of this automaton, taking into account the specified input symbols.-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Methods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton
createDynamicStateMapping, createStaticStateMapping, getStates, iterator, size, stateIDs
-
Methods inherited from interface net.automatalib.ts.simple.SimpleTS
getInitialStates, getStates, getSuccessors, getSuccessors
-
Methods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessor, getSuccessors, getTransitions, powersetView
-
Methods inherited from interface net.automatalib.ts.UniversalTransitionSystem
getStateProperty, getTransitionProperty
-
-
-
-
Method Detail
-
transitionGraphView
default UniversalGraph<S,TransitionEdge<I,T>,SP,TransitionEdge.Property<I,TP>> transitionGraphView(Collection<? extends I> inputs)
Description copied from interface:Automaton
Obtains agraph
view of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented asTransitionEdge
s in the graph.- Specified by:
transitionGraphView
in interfaceAutomaton<S,I,T>
- Parameters:
inputs
- the input symbols to consider- Returns:
- a graph view of the transition graph of this automaton for the given input symbols
-
-