Module net.automatalib.api
Package net.automatalib.automaton
Interface UniversalAutomaton<S,I,T,SP,TP>
- Type Parameters:
S- state typeI- input symbol typeT- transition typeSP- state property typeTP- transition property type
- All Superinterfaces:
Automaton<S,,I, T> FiniteRepresentation,InitialStates<S>,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> MMLT<S,,I, T, O> ModalTransitionSystem<S,,I, T, TP> MooreMachine<S,,I, T, O> MutableAutomaton<S,,I, T, SP, TP> MutableAutomaton.RegularAutomaton<S,,I, T, SP, TP> MutableDeterministic<S,,I, T, SP, TP> MutableDeterministic.RegularAutomaton<S,,I, T, SP, TP> MutableDFA<S,,I> MutableFSA<S,,I> MutableMealyMachine<S,,I, T, O> MutableMMLT<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> ProbabilisticMealyMachine<S,,I, T, O> SEVPA<L,,I> StateLocalInputMealyMachine<S,,I, T, O> SubsequentialTransducer<S,,I, T, O> UniversalAutomaton.RegularAutomaton<S,,I, T, SP, TP> UniversalDeterministicAutomaton<S,,I, T, SP, TP> UniversalDeterministicAutomaton.RegularAutomaton<S,,I, T, SP, TP> UniversalFiniteAlphabetAutomaton<S,I, T, SP, TP>
- All Known Implementing Classes:
AbstractBricsAutomaton,AbstractCompact,AbstractCompactDeterministic,AbstractCompactMTS,AbstractCompactSimpleDeterministic,AbstractCompactSimpleNondet,AbstractDefaultSEVPA,AbstractFastMutable,AbstractFastMutableDet,AbstractFastMutableNondet,AbstractSEVPA,BricsDFA,BricsNFA,CompactDFA,CompactMealy,CompactMMLT,CompactMoore,CompactMTS,CompactNFA,CompactSimpleAutomaton,CompactSST,CompactTransitionOutput,DefaultNSEVPA,DefaultOneSEVPA,DFALassoImpl,FastDFA,FastMealy,FastMoore,FastNFA,FastProbMealy,MealyLassoImpl,ProductOneSEVPA,ReducedMMLTSemantics,UniversalCompactDet,UniversalCompactDetAutomaton,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. See
UniversalTransitionSystem for a further explanation of this concept.-
Nested Class Summary
Nested Classes -
Method Summary
Modifier and TypeMethodDescriptiondefault UniversalGraph<S,TransitionEdge<I, T>, SP, TransitionEdge.Property<I, TP>> transitionGraphView(Collection<? extends I> inputs) Obtains agraphview of the transition graph of this automaton, taking into account the specified input symbols.Methods inherited from interface net.automatalib.automaton.concept.InitialStates
getInitialStatesMethods inherited from interface java.lang.Iterable
forEach, spliteratorMethods inherited from interface net.automatalib.automaton.simple.SimpleAutomaton
createDynamicStateMapping, createStaticStateMapping, getStates, iterator, size, stateIDsMethods inherited from interface net.automatalib.ts.simple.SimpleTS
getStates, getSuccessorsMethods inherited from interface net.automatalib.ts.TransitionSystem
getSuccessor, getSuccessors, getTransitions, powersetViewMethods inherited from interface net.automatalib.ts.UniversalTransitionSystem
getStateProperty, getTransitionProperty
-
Method Details
-
transitionGraphView
default UniversalGraph<S,TransitionEdge<I, transitionGraphViewT>, SP, TransitionEdge.Property<I, TP>> (Collection<? extends I> inputs) Description copied from interface:AutomatonObtains agraphview of the transition graph of this automaton, taking into account the specified input symbols. The transitions are represented asTransitionEdges in the graph.- Specified by:
transitionGraphViewin 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
-